Query optimization by simulated annealing
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Almost all k-colorable graphs are easy to color
Journal of Algorithms
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Optimization of large join queries: combining heuristics and combinatorial techniques
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 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
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
Rapid bushy join-order optimization with Cartesian products
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the complexity of generating optimal plans with cross products (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Counting, enumerating, and sampling of execution plans in a cost-based query optimizer
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Database System Concepts
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A Polynomial Time Algorithm for Optimizing Join Queries
Proceedings of the Ninth International Conference on Data Engineering
Uniformly-Distributed Random Generation of Join Orders
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Fast, Randomized Join-Order Selection - Why Use Transformations?
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Complexity of Transformation-Based Join Enumeration
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Heuristic and randomized optimization for the join ordering problem
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting cost distributions for query optimization
Exploiting cost distributions for query optimization
Cost distributions in symmetric euclidean traveling salesman problems -- a supplement to TSPLIB
Cost distributions in symmetric euclidean traveling salesman problems -- a supplement to TSPLIB
| Hi-index | 0.00 |
Uniform sampling of join orders is known to be a competitive alternative to transformation-based optimization techniques. However, uniformity of the sampling process is difficult to establish and only for a restricted class ofjoin queries techniques are known. In this paper, we investigate non-uniform sampling devising a simple yet powerful algorithm that is generally applicable. The key element of the algorithm is a mapping ofrandomly generated sequences ofjoin predicates to query plans. We take advantage ofthe bottom-up constructing ofquery plans by simultaneously computing the costs and discarding partial plans as soon as they exceed the best costs found so far, which implements a highly effective cost-bound pruning component. Sampling does not produce the optimal plan but a near-optimal solution which is fully sufficient as the cost function grows more and more inaccurate with increasing query size. In return, our algorithm establishes a well-balanced trade-off between result quality and time invested in the optimization process.