Back to papers
Solving the Join Ordering Problem via Mixed Integer Linear Programming
Summary: Join ordering as MILP with binary operands/intermediates and linear constraints enforcing plans and costs. Integrated into Postgres, it uses MILP solvers' anytime search to optimize up to 40 tables in under a min, beats traditional optimizers.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5416
- Venue
- SIGMOD
- Year
- 2017
- Pagerank
- 7.0560383e-05
- Overall Rank
- 3,476 | 75.85%
- DOI
-
10.1145/3035918.3064039
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,621 |
Adaptive Optimization of Very Large Join Queries |
2018 |
SIGMOD |
0.00011105663 |
| 3,152 |
Opportunities for Quantum Acceleration of Databases: Optimization of Queries and Transaction Schedules |
2023 |
VLDB |
7.4709765e-05 |
| 5,497 |
SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra |
2020 |
VLDB |
5.4741034e-05 |
| 5,633 |
Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware |
2023 |
SIGMOD |
5.3993005e-05 |
| 6,060 |
Efficient Massively Parallel Join Optimization for Large Queries* |
2022 |
SIGMOD |
5.2271244e-05 |
| 7,486 |
Quantum-Inspired Digital Annealing for Join Ordering |
2024 |
VLDB |
4.7135369e-05 |
| 8,078 |
AJoin: Ad-hoc Stream Joins at Scale |
2020 |
VLDB |
4.5873626e-05 |
| 8,177 |
Applicability of Quantum Computing on Database Query Optimization |
2022 |
SIGMOD |
4.5630807e-05 |
| 10,295 |
Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation |
2026 |
VLDB |
4.1905499e-05 |
| 10,580 |
Quantum Data Management in the NISQ Era |
2025 |
VLDB |
4.1905499e-05 |
| 10,639 |
Is Integer Linear Programming All You Need for Deletion Propagation? |
2025 |
VLDB |
4.1905499e-05 |
| 10,990 |
DPconv: Super-Polynomially Faster Join Ordering |
2024 |
SIGMOD |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 25 of 25 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 |
| 140 |
Predicate Migration: Optimizing Queries with Expensive Predicates |
1993 |
SIGMOD |
0.00042289025 |
| 388 |
Optimization of Large Join Queries |
1988 |
SIGMOD |
0.00024654816 |
| 400 |
Randomized Algorithms For Optimizing Large Join Queries |
1990 |
SIGMOD |
0.00024308369 |
| 422 |
Measuring the Complexity of Join Enumeration in Query Optimization |
1990 |
VLDB |
0.00023654556 |
| 782 |
Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques |
1989 |
SIGMOD |
0.00016665859 |
| 979 |
Rapid Bushy Join-order Optimization with Cartesian Products |
1996 |
SIGMOD |
0.00014871114 |
| 991 |
Improved Unnesting Algorithms for Join Aggregate SQL Queries |
1992 |
VLDB |
0.00014797083 |
| 1,344 |
Dynamic Programming Strikes Back |
2008 |
SIGMOD |
0.00012477274 |
| 1,644 |
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions |
2002 |
VLDB |
0.0001102889 |
| 1,725 |
Design and Analysis of Parametric Query Optimization Algorithms |
1998 |
VLDB |
0.0001073575 |
| 1,774 |
Optimizing Disjunctive Queries with Expensive Predicates |
1994 |
SIGMOD |
0.0001059836 |
| 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 |
| 1,911 |
Algorithms for Materialized View Design in Data Warehousing Environment |
1997 |
VLDB |
0.00010117173 |
| 1,990 |
AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions |
2003 |
VLDB |
9.8491124e-05 |
| 2,216 |
Skew in Parallel Query Processing |
2014 |
PODS |
9.2693784e-05 |
| 2,247 |
Orca: A Modular Query Optimizer Architecture for Big Data |
2014 |
SIGMOD |
9.201975e-05 |
| 2,652 |
Multi-Objective Parametric Query Optimization |
2015 |
VLDB |
8.3662031e-05 |
| 3,402 |
Query Optimizers: Time to Rethink the Contract? |
2009 |
SIGMOD |
7.134261e-05 |
| 4,189 |
On the Complexity of Approximate Query Optimization |
2002 |
PODS |
6.3681294e-05 |
| 4,255 |
Parallelizing Query Optimization |
2008 |
VLDB |
6.3080082e-05 |
| 5,073 |
An Incremental Anytime Algorithm for Multi-Objective Query Optimization |
2015 |
SIGMOD |
5.7118738e-05 |
| 6,333 |
Parallelizing Extensible Query Optimizers |
2009 |
SIGMOD |
5.1013149e-05 |
| 6,336 |
Dependency-Aware Reordering for Parallelizing Query Optimization in Multi-Core CPUs |
2009 |
SIGMOD |
5.1009488e-05 |
| 9,312 |
Parallelizing Query Optimization on Shared-Nothing Architectures |
2016 |
VLDB |
4.353536e-05 |
Semantically Similar Papers