Simplicity Done Right for Join Ordering
Summary: Lightweight join-ordering: a simple general upper bound for multi-joins, bound-guided enumeration, and sampling-as-execution for fast selectivity estimates. Delivers much lower planning overhead and consistently faster end-to-end JOB runtimes than prior work. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Axel Hertzschuch
- 2. Claudio Hartmann
- 3. Dirk Habich
- 4. Wolfgang Lehner
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,065 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5899218e-05 |
| 979 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD | 0.00014871114 |
| 3,476 | Solving the Join Ordering Problem via Mixed Integer Linear Programming | 2017 | SIGMOD | 7.0560383e-05 |
| 388 | Optimization of Large Join Queries | 1988 | SIGMOD | 0.00024654816 |
| 7,165 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.807833e-05 |
| 8,149 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5715614e-05 |
| 1,621 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011105663 |
| 71 | How Good Are Query Optimizers, Really? | 2016 | VLDB | 0.00059446482 |
| 11,710 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD | 4.1905499e-05 |
| 4,734 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9553181e-05 |