Dynamic query evaluation plans
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Optimization of dynamic query evaluation plans
SIGMOD '94 Proceedings of the 1994 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
Design and Analysis of Parametric Query Optimization Algorithms
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
A characterization of the sensitivity of query optimization to storage access cost parameters
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Analyzing plan diagrams of database query optimizers
VLDB '05 Proceedings of the 31st international conference on Very large data bases
AniPQO: almost non-intrusive parametric query optimization for nonlinear cost functions
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Staying FIT: efficient load shedding techniques for distributed stream processing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On the production of anorexic plan diagrams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient use of the query optimizer for automated physical design
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Foundations and Trends in Databases
Identifying robust plans through plan diagram reduction
Proceedings of the VLDB Endowment
Efficiently approximating query optimizer plan diagrams
Proceedings of the VLDB Endowment
The Picasso database query optimizer visualizer
Proceedings of the VLDB Endowment
Plan b: uncertainty/time trade-offs for linear and integer programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Peak power plays in database engines
Proceedings of the 15th International Conference on Extending Database Technology
CODD: constructing dataless databases
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
The QOL approach for optimizing distributed queries without complete knowledge
Proceedings of the 16th International Database Engineering & Applications Sysmposium
| Hi-index | 0.00 |
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query optimization (PQO) optimizes a query into a number of candidate plans, each optimal for some region of the parameter space. We first propose a solution for the PQO problem for the case when the cost functions are linear in the given parameters. This solution is minimally intrusive in the sense that an existing query optimizer can be used with minor modifications: the solution invokes the conventional query optimizer multiple times, with different parameter values. We then propose a solution for the PQO problem for the case when the cost functions are piecewise-linear in the given parameters. The solution is based on modification of an existing query optimizer. This solution is quite general, since arbitrary cost functions can be approximated to piecewise linear form. Both the solutions work for an arbitrary number of parameters.