Sciweavers

1042 search results - page 64 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 8 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 9 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
BROADNETS
2004
IEEE
13 years 11 months ago
Structures for In-Network Moving Object Tracking in Wireless Sensor Networks
One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storag...
Chih-Yu Lin, Yu-Chee Tseng
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
14 years 26 days ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...