Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation

Summary: Novel MILP formulation for arbitrary bushy join trees allows off‑the‑shelf MILP solvers to find high-quality join orders where prior MILP approaches failed. Hybrid framework applies MILP selectively to hard subproblems, scaling robustly to ~100-way joins. (summarized by gpt-5-mini on Mar 13 2026)

Paper ID: 14323
Venue: VLDB
Year: 2026
Pagerank: 4.1945683e-05
Overall Rank: 10,283 | 28.47%
DOI: 10.14778/3778092.3778097

Incoming Non-self Citations Over Time

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

Authors

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
387	Optimization of Large Join Queries	1988	SIGMOD	0.0002471967
399	Randomized Algorithms For Optimizing Large Join Queries	1990	SIGMOD	0.00024315433
784	Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques	1989	SIGMOD	0.00016675823
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
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,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
7,486	Quantum-Inspired Digital Annealing for Join Ordering	2024	VLDB	4.7180617e-05
7,816	1,000 Tables Under the From	2009	VLDB	4.6437215e-05
8,176	Applicability of Quantum Computing on Database Query Optimization	2022	SIGMOD	4.5674639e-05
9,305	Parallelizing Query Optimization on Shared-Nothing Architectures	2016	VLDB	4.3577129e-05
10,023	Large-Scale Multiple Query Optimisation with Incremental Quantum(-Inspired) Annealing	2026	SIGMOD	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
143	Optimization of Nonrecursive Queries	1986	VLDB	0.00041510555
6,056	Efficient Massively Parallel Join Optimization for Large Queries*	2022	SIGMOD	5.2321475e-05
7,486	Quantum-Inspired Digital Annealing for Join Ordering	2024	VLDB	4.7180617e-05
387	Optimization of Large Join Queries	1988	SIGMOD	0.0002471967
2,044	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB	9.6953608e-05
2,275	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB	9.1262202e-05
4,738	Query Simplification: Graceful Degradation for Join-Order Optimization	2009	SIGMOD	5.9600502e-05
8,164	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD	4.5718104e-05
1,619	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011111678
3,474	Solving the Join Ordering Problem via Mixed Integer Linear Programming	2017	SIGMOD	7.0625972e-05