Back to papers
DPconv: Super-Polynomially Faster Join Ordering
Summary: DPconv introduces a subset-convolution based framework for exact join ordering. It breaks the O(3^n) barrier, delivering super-polynomial speedups over DPccp, up to 30x faster for large-clique C_max cost queries.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6982
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,987 | 23.57%
- DOI
-
10.1145/3698809
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 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.0040449103 |
| 71 |
How Good Are Query Optimizers, Really? |
2016 |
VLDB |
0.00059038975 |
| 143 |
Optimization of Nonrecursive Queries |
1986 |
VLDB |
0.00041510555 |
| 219 |
Grammar-like Functional Rules for Representing Query Optimization Alternatives |
1988 |
SIGMOD |
0.00033244259 |
| 423 |
Measuring the Complexity of Join Enumeration in Query Optimization |
1990 |
VLDB |
0.00023669348 |
| 502 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021526612 |
| 978 |
Rapid Bushy Join-order Optimization with Cartesian Products |
1996 |
SIGMOD |
0.00014881073 |
| 1,341 |
Dynamic Programming Strikes Back |
2008 |
SIGMOD |
0.00012486285 |
| 1,619 |
Adaptive Optimization of Very Large Join Queries |
2018 |
SIGMOD |
0.00011111678 |
| 1,826 |
Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products |
2006 |
VLDB |
0.00010400425 |
| 2,050 |
Optimal Top-Down Join Enumeration |
2007 |
SIGMOD |
9.6886663e-05 |
| 2,783 |
Flow-Loss: Learning Cardinality Estimates That Matter |
2021 |
VLDB |
8.1293383e-05 |
| 3,474 |
Solving the Join Ordering Problem via Mixed Integer Linear Programming |
2017 |
SIGMOD |
7.0625972e-05 |
| 4,194 |
On the Complexity of Approximate Query Optimization |
2002 |
PODS |
6.3697822e-05 |
| 4,593 |
Auto-WLM: Machine Learning Enhanced Workload Management in Amazon Redshift |
2023 |
SIGMOD |
6.0606891e-05 |
| 4,738 |
Query Simplification: Graceful Degradation for Join-Order Optimization |
2009 |
SIGMOD |
5.9600502e-05 |
| 5,626 |
Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware |
2023 |
SIGMOD |
5.4044935e-05 |
| 6,972 |
Predicate Caching: Query-Driven Secondary Indexing for Cloud Data Warehouses |
2024 |
SIGMOD |
4.8785237e-05 |
| 8,164 |
Efficiently Computing Join Orders with Heuristic Search |
2023 |
SIGMOD |
4.5718104e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,953 |
On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms |
2023 |
PODS |
5.8085795e-05 |
| 6,056 |
Efficient Massively Parallel Join Optimization for Large Queries* |
2022 |
SIGMOD |
5.2321475e-05 |
| 1,619 |
Adaptive Optimization of Very Large Join Queries |
2018 |
SIGMOD |
0.00011111678 |
| 8,164 |
Efficiently Computing Join Orders with Heuristic Search |
2023 |
SIGMOD |
4.5718104e-05 |
| 4,194 |
On the Complexity of Approximate Query Optimization |
2002 |
PODS |
6.3697822e-05 |
| 4,523 |
Simplicity Done Right for Join Ordering |
2021 |
CIDR |
6.1135504e-05 |
| 4,738 |
Query Simplification: Graceful Degradation for Join-Order Optimization |
2009 |
SIGMOD |
5.9600502e-05 |
| 5,553 |
On the Complexity of Join Predicates |
2001 |
PODS |
5.439162e-05 |
| 3,715 |
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries |
2020 |
VLDB |
6.8220943e-05 |
| 1,341 |
Dynamic Programming Strikes Back |
2008 |
SIGMOD |
0.00012486285 |