Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products

@article{Moerkotte2006AnalysisOT,
  title={Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products},
  author={G. Moerkotte and T. Neumann},
  journal={Proc. VLDB Endow.},
  year={2006},
  volume={11},
  pages={1069-1070}
}
  • G. Moerkotte, T. Neumann
  • Published 2006
  • Computer Science
  • Proc. VLDB Endow.
  • 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… CONTINUE READING

    Figures and Topics from this paper.

    Dynamic programming strikes back
    • 74
    • Open Access
    A new, highly efficient, and easy to implement top-down join enumeration algorithm
    • 22
    • Open Access
    Query simplification: graceful degradation for join-order optimization
    • 32
    • Highly Influenced
    Optimal top-down join enumeration
    • 49
    • Highly Influenced
    Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs
    • 10
    • Open Access
    Reassessing Top-Down Join Enumeration
    • 6
    Top down plan generation: From theory to practice
    • 8
    Adaptive Optimization of Very Large Join Queries
    • 23
    • Open Access
    Optimization Strategy of Top-Down Join Enumeration on Modern Multi-Core CPUs
    • 4
    • Highly Influenced
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 REFERENCES
    Measuring the Complexity of Join Enumeration in Query Optimization
    • 209
    • Highly Influential
    Rapid bushy join-order optimization with Cartesian products
    • 114
    • Highly Influential
    • Open Access
    Join-order optimization with cartesian products
    • 10
    • Highly Influential
    Query Optimization in the IBM DB2 Family.
    • 93
    • Highly Influential