Sciweavers

619 search results - page 37 / 124
» Query Planning in Infomaster
Sort
View
CIKM
2009
Springer
15 years 8 months ago
Workload-aware trie indices for XML
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
Yuqing Wu, Sofia Brenes, Hyungdae Yi
DMSN
2009
ACM
15 years 8 months ago
Validated cost models for sensor network queries
Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...
IJCAI
1997
15 years 3 months ago
Efficiently Executing Information-Gathering Plans
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
Marc Friedman, Daniel S. Weld
ICDE
2009
IEEE
101views Database» more  ICDE 2009»
16 years 3 months ago
Power Hints for Query Optimization
Commercial database systems expose query hints to address situations in which the optimizer chooses a poor plan for a given query. However, current query hints are not flexible eno...
Nicolas Bruno, Surajit Chaudhuri, Ravishankar Rama...
TKDE
2010
200views more  TKDE 2010»
15 years 9 days ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...