DBScholar

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
5477
Venue
SIGMOD
Year
2017
Pagerank
7.6888079e-05
Overall Rank
3,158 | 78.34%
DOI
10.1145/3035918.3064039

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{trummer_sigmod17,
        title = {{Solving the Join Ordering Problem via Mixed Integer Linear Programming}},
        author = {Trummer, Immanuel and Koch, Christoph},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3064039},
        url = {https://dl.acm.org/doi/10.1145/3035918.3064039},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

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.0024089429
132 Predicate Migration: Optimizing Queries with Expensive Predicates 1993 SIGMOD 0.00030378624
316 Measuring the Complexity of Join Enumeration in Query Optimization 1990 VLDB 0.0002141607
463 Optimization of Large Join Queries 1988 SIGMOD 0.00018064961
479 Randomized Algorithms For Optimizing Large Join Queries 1990 SIGMOD 0.00017789732
698 Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques 1989 SIGMOD 0.00014879675
774 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00014123979
1,012 Improved Unnesting Algorithms for Join Aggregate SQL Queries 1992 VLDB 0.00012682631
1,013 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012652549
1,298 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00011259156
1,321 Parametric Query Optimization for Linear and Piecewise Linear Cost Functions 2002 VLDB 0.00011162369
1,448 Skew in Parallel Query Processing 2014 PODS 0.00010758872
1,470 Design and Analysis of Parametric Query Optimization Algorithms 1998 VLDB 0.00010676869
1,621 Orca: A Modular Query Optimizer Architecture for Big Data 2014 SIGMOD 0.00010203114
1,645 AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions 2003 VLDB 0.00010129244
1,743 Algorithms for Materialized View Design in Data Warehousing Environment 1997 VLDB 9.8702732e-05
1,826 Optimizing Disjunctive Queries with Expensive Predicates 1994 SIGMOD 9.6721003e-05
2,540 Multi-Objective Parametric Query Optimization 2015 VLDB 8.45187e-05
2,944 Query Optimizers: Time to Rethink the Contract? 2009 SIGMOD 7.9335187e-05
3,553 On the Complexity of Approximate Query Optimization 2002 PODS 7.3175599e-05
3,726 Parallelizing Query Optimization 2008 VLDB 7.1697834e-05
4,880 An Incremental Anytime Algorithm for Multi-Objective Query Optimization 2015 SIGMOD 6.4656221e-05
6,018 Dependency-Aware Reordering for Parallelizing Query Optimization in Multi-Core CPUs 2009 SIGMOD 6.0060585e-05
6,026 Parallelizing Extensible Query Optimizers 2009 SIGMOD 6.0024042e-05
9,446 Parallelizing Query Optimization on Shared-Nothing Architectures 2016 VLDB 5.2667452e-05
Previous Page 1 / 1 Next

Semantically Similar Papers