Sciweavers

281 search results - page 9 / 57
» Querying the Guarded Fragment
Sort
View
63
Voted
AAAI
2008
15 years 13 days ago
Extending the Knowledge Compilation Map: Krom, Horn, Affine and Beyond
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment)...
Hélène Fargier, Pierre Marquis
DPD
2002
168views more  DPD 2002»
14 years 10 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
96
Voted
SSDBM
2007
IEEE
121views Database» more  SSDBM 2007»
15 years 4 months ago
Cost-based Optimization of Complex Scientific Queries
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...
Ruslan Fomkin, Tore Risch
DBPL
2001
Springer
115views Database» more  DBPL 2001»
15 years 2 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen
SEMWEB
2009
Springer
15 years 4 months ago
Conjunctive Query Answering in Distributed Ontology Systems for Ontologies with Large OWL ABoxes
We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed...
Xueying Chen, Michel Dumontier