Sciweavers

128 search results - page 1 / 26
» Plan Selection Based on Query Clustering
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 4 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 4 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
DKE
2008
87views more  DKE 2008»
13 years 4 months ago
Region clustering based evaluation of multiple top-N selection queries
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...
Liang Zhu, Weiyi Meng, Wenzhu Yang, Chunnian Liu
PVLDB
2008
122views more  PVLDB 2008»
13 years 4 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
ADC
2004
Springer
147views Database» more  ADC 2004»
13 years 10 months ago
Clustering Moving Objects for Spatio-temporal Selectivity Estimation
Many spatio-temporal applications involve managing and querying moving objects. In such an environment, predictive spatio-temporal queries become an important query class to be pr...
Qing Zhang, Xuemin Lin