DBScholar

Back to papers

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

Summary: Introduces a MILP formulation for optimal arbitrary bushy join trees, overcoming prior models’ structural limits. A hybrid strategy invokes MILP selectively, scaling to 100-way joins while delivering robustly superior plan quality. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h8afd181983ab98f6
Venue
VLDB
Year
2026
Pagerank
5.292093e-05
Overall Rank
8,659 | 41.81%
DOI
10.14778/3778092.3778097
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{schonberger_vldb26,
        title = {{Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation}},
        author = {Schönberger, Manuel and Trummer, Immanuel and Mauerer, Wolfgang},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {3},
        pages = {348--360},
        doi = {10.14778/3778092.3778097},
        url = {https://doi.org/10.14778/3778092.3778097},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,380 Coresets for Robust Query Optimization 2026 PODS 4.9769913e-05
11,026 QFusion: A Demonstration of Boundary-Aware Fusion Planning and Execution for Large-Scale QUBO Optimization 2026 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

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.0023943337
15 How Good Are Query Optimizers, Really? 2016 VLDB 0.00061067652
143 Optimization of Nonrecursive Queries 1986 VLDB 0.00029168671
469 Optimization of Large Join Queries 1988 SIGMOD 0.00017749337
487 Randomized Algorithms For Optimizing Large Join Queries 1990 SIGMOD 0.00017455404
708 Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques 1989 SIGMOD 0.00014623779
796 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00013931773
883 Dynamic Programming Strikes Back 2008 SIGMOD 0.00013263866
1,185 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011607329
1,301 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00011107788
3,140 Solving the Join Ordering Problem via Mixed Integer Linear Programming 2017 SIGMOD 7.6012971e-05
3,568 On the Complexity of Approximate Query Optimization 2002 PODS 7.1978817e-05
3,800 Query Simplification: Graceful Degradation for Join-Order Optimization 2009 SIGMOD 7.0130412e-05
4,406 Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware 2023 SIGMOD 6.6103825e-05
5,911 Quantum-Inspired Digital Annealing for Join Ordering 2024 VLDB 5.9478816e-05
7,405 Large-Scale Multiple Query Optimisation with Incremental Quantum(-Inspired) Annealing 2026 SIGMOD 5.5331324e-05
7,726 1,000 Tables Under the From 2009 VLDB 5.4654486e-05
8,673 Applicability of Quantum Computing on Database Query Optimization 2022 SIGMOD 5.2897413e-05
9,628 Parallelizing Query Optimization on Shared-Nothing Architectures 2016 VLDB 5.1473253e-05
Previous Page 1 / 1 Next

Semantically Similar Papers