Dynamic Programming Strikes Back
Summary: DP-based join ordering extended to complex predicates with DPhyp, modeling the query as a hypergraph and reasoning over subgraphs to enable multiway and non-inner joins. Experiments show speedups over memoization-based approaches for complex predicates, underscoring DP's advantage in modern join optimization. (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
@inproceedings{moerkotte_sigmod08,
title = {{Dynamic Programming Strikes Back}},
author = {Moerkotte, Guido and Neumann, Thomas},
series = {{SIGMOD} '08},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1376616.1376672},
url = {https://dl.acm.org/doi/10.1145/1376616.1376672},
year = {2008}
}Incoming Citations (Sorted by Pagerank)
Showing 44 of 44 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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.0023948467 |
| 554 | Orthogonal Optimization of Subqueries and Aggregation | 2001 | SIGMOD | 0.00016487919 |
| 794 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD | 0.0001389694 |
| 1,063 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00012198695 |
| 1,293 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB | 0.00011143846 |
| 1,732 | Optimal Top-Down Join Enumeration | 2007 | SIGMOD | 9.7561649e-05 |
| 3,279 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD | 7.4510308e-05 |
| 4,289 | XQuery Implementation in a Relational Database System | 2005 | VLDB | 6.6676702e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,064 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD |
| 2 | 5,446 | Efficient Massively Parallel Join Optimization for Large Queries* | 2022 | SIGMOD |
| 3 | 2,602 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 4 | 7,630 | On the Complexity of Join Predicates | 2001 | PODS |
| 5 | 3,785 | Parallelizing Query Optimization | 2008 | VLDB |
| 6 | 10,585 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |
| 7 | 9,244 | DPconv: Super-Polynomially Faster Join Ordering | 2024 | SIGMOD |
| 8 | 1,293 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB |
| 9 | 3,807 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 10 | 3,279 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD |