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: 6983
Venue: SIGMOD
Year: 2024
Pagerank: 4.1905499e-05
Overall Rank: 10,990 | 23.62%
DOI: 10.1145/3698809

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Mihail Stoian
2. Andreas Kipf

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.0040465394
71	How Good Are Query Optimizers, Really?	2016	VLDB	0.00059446482
144	Optimization of Nonrecursive Queries	1986	VLDB	0.00041430126
220	Grammar-like Functional Rules for Representing Query Optimization Alternatives	1988	SIGMOD	0.00033312045
422	Measuring the Complexity of Join Enumeration in Query Optimization	1990	VLDB	0.00023654556
503	Worst-case Optimal Join Algorithms	2012	PODS	0.00021517145
979	Rapid Bushy Join-order Optimization with Cartesian Products	1996	SIGMOD	0.00014871114
1,344	Dynamic Programming Strikes Back	2008	SIGMOD	0.00012477274
1,621	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011105663
1,825	Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products	2006	VLDB	0.00010392367
2,053	Optimal Top-Down Join Enumeration	2007	SIGMOD	9.682841e-05
2,781	Flow-Loss: Learning Cardinality Estimates That Matter	2021	VLDB	8.1282042e-05
3,476	Solving the Join Ordering Problem via Mixed Integer Linear Programming	2017	SIGMOD	7.0560383e-05
4,189	On the Complexity of Approximate Query Optimization	2002	PODS	6.3681294e-05
4,592	Auto-WLM: Machine Learning Enhanced Workload Management in Amazon Redshift	2023	SIGMOD	6.056004e-05
4,734	Query Simplification: Graceful Degradation for Join-Order Optimization	2009	SIGMOD	5.9553181e-05
5,633	Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware	2023	SIGMOD	5.3993005e-05
6,971	Predicate Caching: Query-Driven Secondary Indexing for Cloud Data Warehouses	2024	SIGMOD	4.8738633e-05
8,149	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD	4.5715614e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,926	On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms	2023	PODS	5.8184457e-05
6,060	Efficient Massively Parallel Join Optimization for Large Queries*	2022	SIGMOD	5.2271244e-05
1,621	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011105663
8,149	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD	4.5715614e-05
4,189	On the Complexity of Approximate Query Optimization	2002	PODS	6.3681294e-05
4,526	Simplicity Done Right for Join Ordering	2021	CIDR	6.1079584e-05
4,734	Query Simplification: Graceful Degradation for Join-Order Optimization	2009	SIGMOD	5.9553181e-05
5,561	On the Complexity of Join Predicates	2001	PODS	5.4346872e-05
3,702	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	6.8251643e-05
1,344	Dynamic Programming Strikes Back	2008	SIGMOD	0.00012477274