Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products
Summary: Compares two DP variants for optimal bushy join trees without cross products; shows runtime divergence across chain, clique, and star graphs. Proposes an adaptive DP algorithm that tunes the search space to the query graph, outperforming both variants across structures. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Guido Moerkotte (University of Mannheim)
- 2. Thomas Neumann (Max Planck Institute)
BibTeX Citation
@article{moerkotte_vldb06,
title = {{Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products}},
author = {Moerkotte, Guido and Neumann, Thomas},
journal = {PVLDB},
series = {{VLDB} '06},
pages = {930--941},
doi = {10.14778/1164135.1164151},
url = {https://doi.org/10.14778/1164135.1164151},
year = {2006}
}Incoming Citations (Sorted by Pagerank)
Showing 45 of 45 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1 | Access Path Selection in a Relational Database Management System | 1979 | SIGMOD | 0.0023947656 |
| 321 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB | 0.00021088704 |
| 796 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD | 0.00013938011 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 2 | 10,508 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |
| 3 | 8,195 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS |
| 4 | 3,797 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 5 | 8,651 | Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation | 2026 | VLDB |
| 6 | 3,572 | Multi-Join Optimization for Symmetric Multiprocessors | 1993 | VLDB |
| 7 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 8 | 12,229 | Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products" | 2018 | VLDB |
| 9 | 884 | Dynamic Programming Strikes Back | 2008 | SIGMOD |
| 10 | 6,110 | On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) | 1997 | PODS |