On estimating the cardinality of the projection of a database relation
ACM Transactions on Database Systems (TODS)
Dynamic query evaluation plans
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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
Multiple join size estimation by virtual domains (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the estimation of join result sizes
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Optimization of dynamic query evaluation plans
SIGMOD '94 Proceedings of the 1994 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
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
Support for repetitive transactions and ad hoc queries in System R
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Answering complex SQL queries using automatic summary tables
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Exploiting statistics on query expressions for optimization
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
LEO - DB2's LEarning Optimizer
Proceedings of the 27th International Conference on Very Large Data Bases
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
Efficient query processing for data integration
Efficient query processing for data integration
Adaptive Caching for Continuous Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Increasing the Accuracy and Coverage of SQL Progress Indicators
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
When can we trust progress estimators for SQL queries?
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
VLDB '05 Proceedings of the 31st international conference on Very large data bases
POP/FED: progressive query optimization for federated queries in DB2
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Adaptive rank-aware query optimization in relational databases
ACM Transactions on Database Systems (TODS)
The use of Hints in SQL-Nested query optimization
Information Sciences: an International Journal
Cardinality estimation using sample views with quality assurance
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Progressive optimization in a shared-nothing parallel database
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Towards a query optimizer for text-centric tasks
ACM Transactions on Database Systems (TODS)
Progressive optimization in action
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Self-tuning database systems: a decade of progress
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Adaptive aggregation on chip multiprocessors
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Stop-and-restart style execution for long running decision support queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Cardinality estimation for the optimization of queries on ontologies
ACM SIGMOD Record
Foundations and Trends in Databases
Parallelizing query optimization
Proceedings of the VLDB Endowment
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
Efficiently approximating query optimizer plan diagrams
Proceedings of the VLDB Endowment
Optimizer plan change management: improved stability and performance in Oracle 11g
Proceedings of the VLDB Endowment
Closing the query processing loop in Oracle 11g
Proceedings of the VLDB Endowment
The design of a query monitoring system
ACM Transactions on Database Systems (TODS)
The Psychic-Skeptic Prediction framework for effective monitoring of DBMS workloads
Data & Knowledge Engineering
Time-completeness trade-offs in record linkage using adaptive query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
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
ROX: run-time optimization of XQueries
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Dynamic plan generation for parameterized queries
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
StatAdvisor: recommending statistical views
Proceedings of the VLDB Endowment
Exact cardinality query optimization for optimizer testing
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
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
Self-supervised web search for any-k complete tuples
Proceedings of the 2nd International Workshop on Business intelligencE and the WEB
Run-time adaptivity for search computing
Search computing
Join selectivity re-estimation for repetitive queries in databases
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
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
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
Efficient load balancing in partitioned queries under random perturbations
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Utility-driven adaptive query workload execution
Future Generation Computer Systems
Adaptive optimizations of recursive queries in teradata
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficiently adapting graphical models for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed Adaptive Windowed Stream Join Processing
International Journal of Distributed Systems and Technologies
CS2: a new database synopsis for query estimation
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Optimus: a dynamic rewriting framework for data-parallel execution plans
Proceedings of the 8th ACM European Conference on Computer Systems
Beyond search: Retrieving complete tuples from a text-database
Information Systems Frontiers
Continuous cloud-scale query optimization and processing
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation errors can occur due to the use of inaccurate statistics, invalid assumptions about attribute independence, parameter markers, and so on. Cardinality estimation errors may cause the optimizer to choose a sub-optimal plan. We present an approach to query processing that is extremely robust because it is able to detect and recover from cardinality estimation errors. We call this approach "progressive query optimization" (POP). POP validates cardinality estimates against actual values as measured during query execution. If there is significant disagreement between estimated and actual values, execution might be stopped and re-optimization might occur. Oscillation between optimization and execution steps can occur any number of times. A re-optimization step can exploit both the actual cardinality and partial results, computed during a previous execution step. Checkpoint operators (CHECK) validate the optimizer's cardinality estimates against actual cardinalities. Each CHECK has a condition that indicates the cardinality bounds within which a plan is valid. We compute this validity range through a novel sensitivity analysis of query plan operators. If the CHECK condition is violated, CHECK triggers re-optimization. POP has been prototyped in a leading commercial DBMS. An experimental evaluation of POP using TPC-H queries illustrates the robustness POP adds to query processing, while incurring only negligible overhead. A case-study applying POP to a real-world database and workload shows the potential of POP, accelerating complex OLAP queries by almost two orders of magnitude.