Sciweavers

1004 search results - page 99 / 201
» Safe Constraint Queries
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 9 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
PVLDB
2010
146views more  PVLDB 2010»
13 years 7 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras
SIGMOD
2003
ACM
171views Database» more  SIGMOD 2003»
14 years 9 months ago
Adaptive Filters for Continuous Queries over Distributed Data Streams
We consider an environment where distributed data sources continuously stream updates to a centralized processor that monitors continuous queries over the distributed data. Signif...
Chris Olston, Jing Jiang, Jennifer Widom
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 3 months ago
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
The development of location-based services and advances in the field of mobile computing have motivated an intensive research effort devoted to the efficient processing of locati...
Sergio Ilarri, Antonio Corral, Carlos Bobed, Eduar...
CIKM
2004
Springer
14 years 2 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu