Sciweavers

902 search results - page 8 / 181
» Efficient and Extensible Algorithms for Multi Query Optimiza...
Sort
View
93
Voted
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 3 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
168
Voted
GIS
2005
ACM
15 years 10 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
15 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
15 years 9 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
64
Voted
DLOG
2010
14 years 7 months ago
Query Algebra and Query Optimization for Concept Assertion Retrieval
We develop a query algebra that supports efficient assertion retrieval--a natural extension of instance retrieval. The algebra is based on previously developed techniques for index...
Jeffrey Pound, David Toman, Grant E. Weddell, Jiew...