Rapid bushy join-order optimization with Cartesian products
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
Introduction to Algorithms
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Measuring the Complexity of Join Enumeration in Query Optimization
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Join-order optimization with cartesian products
Join-order optimization with cartesian products
Optimal top-down join enumeration
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Dynamic programming strikes back
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Parallelizing query optimization
Proceedings of the VLDB Endowment
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
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
Distributed stream join query processing with semijoins
Distributed and Parallel Databases
Efficient RDF data management including provenance and uncertainty
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
The lazy flipper: efficient depth-limited exhaustive search in discrete graphical models
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
On the correct and complete enumeration of the core search space
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Counter strike: generic top-down join enumeration for hypergraphs
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Two approaches to derive dynamic programming algorithms for constructing join trees are described in the literature. We show analytically and experimentally that these two variants exhibit vastly diverging runtime behaviors for different query graphs. More specifically, each variant is superior to the other for one kind of query graph (chain or clique), but fails for the other. Moreover, neither of them handles star queries well. This motivates us to derive an algorithm that is superior to the two existing algorithms because it adapts to the search space implied by the query graph.