Extensible/rule based query rewrite optimization in Starburst
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Rapid bushy join-order optimization with Cartesian products
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Avoiding Cartesian products for multiple joins
Journal of the ACM (JACM)
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Journal of the ACM (JACM)
Database Systems: The Complete Book
Database Systems: The Complete Book
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
The Microsoft Relational Engine
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
EROC: A Toolkit for Building NEATO Query Optimizers
VLDB '96 Proceedings of the 22th 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
Exploiting Upper and Lower Bounds In Top-Down Query Optimization
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
OPT++ : an object-oriented implementation for extensible database query optimization
The VLDB Journal — The International Journal on Very Large Data Bases
Join Enumeration in a Memory-Constrained Environment
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Complexity of transformation-based optimizers and duplicate-free generation of alternatives
Complexity of transformation-based optimizers and duplicate-free generation of alternatives
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Cost-based query transformation in Oracle
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Dynamic programming strikes back
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Using slice join for efficient evaluation of multi-way joins
Data & Knowledge Engineering
Parallelizing query optimization
Proceedings of the VLDB Endowment
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
Query simplification: graceful degradation for join-order optimization
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Optimization of joins using random record generation method
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Deriving predicate statistics for logic rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Non-termination analysis and cost-based query optimization of logic programs
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Using similarity distance for performance prediction of the query optimization process
Proceedings of the Sixth International Workshop on Testing Database Systems
Counter strike: generic top-down join enumeration for hypergraphs
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Most contemporary database systems perform cost-based join enumeration using some variant of System-R's bottom-up dynamic programming method. The notable exceptions are systems based on the top-down transformational search of Volcano/Cascades. As recent work has demonstrated, bottom-up dynamic programming can attain optimality with respect to the shape of the join graph; no comparable results have been published for transformational search. However, transformational systems leverage benefits of top-down search not available to bottom-up methods. In this paper we describe a top-down join enumeration algorithm that is optimal with respect to the join graph. We present performance results demonstrating that a combination of optimal enumeration with search strategies such as branch-and-bound yields an algorithm significantly faster than those previously described in the literature. Although our algorithm enumerates the search space top-down, it does not rely on transformations and thus retains much of the architecture of traditional dynamic programming. As such, this work provides a migration path for existing bottom-up optimizers to exploit top-down search without drastically changing to the transformational paradigm.