Hypergraph based reorderings of outer join queries with complex predicates
SIGMOD '95 Proceedings of the 1995 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
Outerjoin simplification and reordering for query optimization
ACM Transactions on Database Systems (TODS)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Using EELs, a Practical Approach to Outerjoin and Antijoin Reordering
Proceedings of the 17th International Conference on Data Engineering
Measuring the Complexity of Join Enumeration in Query Optimization
VLDB '90 Proceedings of the 16th 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
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
An Efficient Framework for Order Optimization
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Optimal top-down join enumeration
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A combined framework for grouping and order optimization
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic programming strikes back
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A new, highly efficient, and easy to implement top-down join enumeration algorithm
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Effective and Robust Pruning for Top-Down Join Enumeration Algorithms
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
On the correct and complete enumeration of the core search space
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Top down plan generation: From theory to practice
ICDE '13 Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)
| Hi-index | 0.00 |
Finding the optimal execution order of join operations is a crucial task of today's cost-based query optimizers. There are two approaches to identify the best plan: bottom-up and top-down join enumeration. But only the top-down approach allows for branch-and-bound pruning, which can improve compile time by several orders of magnitude while still preserving optimality. For both optimization strategies, efficient enumeration algorithms have been published. However, there are two severe limitations for the top-down approach: The published algorithms can handle only (1) simple (binary) join predicates and (2) inner joins. Since real queries may contain complex join predicates involving more than two relations, and outer joins as well as other non-inner joins, efficient top-down join enumeration cannot be used in practice yet. We develop a novel top-down join enumeration algorithm that overcomes these two limitations. Furthermore, we show that our new algorithm is competitive when compared to the state of the art in bottom-up processing even without playing out its advantage by making use of its branch-and-bound pruning capabilities.