Dynamic query evaluation plans
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The effect of bucket size tuning in the dynamic hybrid GRACE hash join method
VLDB '89 Proceedings of the 15th international conference on Very large data bases
On the propagation of errors in the size of join results
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Improved histograms for selectivity estimation of range predicates
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
PREDATOR: a resource for database research
ACM SIGMOD Record
Efficient mid-query re-optimization of sub-optimal query execution plans
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Cost-based query scrambling for initial delays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Least expected cost query optimization: an exercise in utility
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Join synopses for approximate query answering
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
An adaptive query execution system for data integration
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast incremental maintenance of approximate histograms
ACM Transactions on Database Systems (TODS)
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Informix under CONTROL: Online Query Processing
Data Mining and Knowledge Discovery
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Exploiting Punctuation Semantics in Continuous Data Streams
IEEE Transactions on Knowledge and Data Engineering
Distributed query adaptation and its trade-offs
Proceedings of the 2003 ACM symposium on Applied computing
Efficient data reduction with EASE
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Novel query optimization and evaluation techniques
Novel query optimization and evaluation techniques
Adapting to source properties in processing data integration queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust query processing through progressive optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Estimating progress of execution for SQL queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Towards a robust query optimizer: a principled and practical approach
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Proactive re-optimization with Rio
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Content-based routing: different plans for different data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Asking the right questions: model-driven optimization using probes
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
HybMig: A Hybrid Approach to Dynamic Plan Migration for Continuous Queries
IEEE Transactions on Knowledge and Data Engineering
Model-driven optimization using adaptive probes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stop-and-restart style execution for long running decision support queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Foundations and Trends in Databases
Proactive and reactive multi-dimensional histogram maintenance for selectivity estimation
Journal of Systems and Software
Robustness in automatic physical database design
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Identifying robust plans through plan diagram reduction
Proceedings of the VLDB Endowment
A pay-as-you-go framework for query execution feedback
Proceedings of the VLDB Endowment
The design of a query monitoring system
ACM Transactions on Database Systems (TODS)
Adaptive workload allocation in query processing in autonomous heterogeneous environments
Distributed and Parallel Databases
Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options
The VLDB Journal — The International Journal on Very Large Data Bases
Authenticated join processing in outsourced databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
StatAdvisor: recommending statistical views
Proceedings of the VLDB Endowment
Adaptive join processing in pipelined plans
Proceedings of the 13th International Conference on Extending Database Technology
Automation everywhere: autonomics and data management
BNCOD'07 Proceedings of the 24th British national conference on Databases
Dynamic query optimisation: towards decentralised methods
International Journal of Intelligent Information and Database Systems
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
On the stability of plan costs and the costs of plan stability
Proceedings of the VLDB Endowment
Xplus: a SQL-tuning-aware query optimizer
Proceedings of the VLDB Endowment
Mobile Information Systems
Run-time adaptivity for search computing
Search computing
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Progressive query optimization for federated queries
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Recursive SQL query optimization with k-iteration lookahead
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Dynamic plan migration for snapshot-equivalent continuous queries in data stream systems
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
A foundation for the replacement of pipelined physical join operators in adaptive query processing
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Worst-case optimal join algorithms: [extended abstract]
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Adaptive optimizations of recursive queries in teradata
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Re-optimizing data-parallel computing
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Distributed Adaptive Windowed Stream Join Processing
International Journal of Distributed Systems and Technologies
AppSleuth: a tool for database tuning at the application level
Proceedings of the 16th International Conference on Extending Database Technology
Optimus: a dynamic rewriting framework for data-parallel execution plans
Proceedings of the 8th ACM European Conference on Computer Systems
Hi-index | 0.00 |
Traditional query optimizers rely on the accuracy of estimated statistics to choose good execution plans. This design often leads to suboptimal plan choices for complex queries, since errors in estimates for intermediate subexpressions grow exponentially in the presence of skewed and correlated data distributions. Reoptimization is a promising technique to cope with such mistakes. Current re-optimizers first use a traditional optimizer to pick a plan, and then react to estimation errors and resulting suboptimalities detected in the plan during execution. The effectiveness of this approach is limited because traditional optimizers choose plans unaware of issues affecting reoptimization. We address this problem using proactive reoptimization, a new approach that incorporates three techniques: i) the uncertainty in estimates of statistics is computed in the form of bounding boxes around these estimates, ii) these bounding boxes are used to pick plans that are robust to deviations of actual values from their estimates, and iii) accurate measurements of statistics are collected quickly and efficiently during query execution. We present an extensive evaluation of these techniques using a prototype proactive re-optimizer named Rio. In our experiments Rio outperforms current re-optimizers by up to a factor of three.