Measuring the Complexity of Join Enumeration in Query Optimization
Summary: Analyzes Starburst’s parameterized join enumeration, quantifying search-space complexity with composite inner operands and Cartesian joins. Derives and validates shape-dependent counts, showing linear join queries remain polynomial—and optimizable at 100-table scale. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kiyoshi Ono (IBM)
- 2. Guy M. Lehman (IBM)
BibTeX Citation
@article{ono_vldb90,
title = {{Measuring the Complexity of Join Enumeration in Query Optimization}},
author = {Ono, Kiyoshi and Lehman, Guy M.},
journal = {PVLDB},
series = {{VLDB} '90},
pages = {314},
year = {1990}
}
Incoming Citations (Sorted by Pagerank)
Showing 43 of 43 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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 |
| 143 | Optimization of Nonrecursive Queries | 1986 | VLDB | 0.0002959213 |
| 192 | Grammar-like Functional Rules for Representing Query Optimization Alternatives | 1988 | SIGMOD | 0.00026028406 |
| 463 | Optimization of Large Join Queries | 1988 | SIGMOD | 0.00018064961 |
| 2,263 | Optimization of Nested Queries in a Distributed Relational Database | 1984 | VLDB | 8.8440084e-05 |
| 2,512 | An Architecture For Query Optimization | 1982 | SIGMOD | 8.485242e-05 |
| 3,153 | Implementing an Interpreter for Functional Rules in a Query Optimizer | 1988 | VLDB | 7.6976958e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 774 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD |
| 2 | 3,726 | Parallelizing Query Optimization | 2008 | VLDB |
| 3 | 3,813 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 4 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 5 | 1,286 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 6 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 7 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 8 | 18 | How Good Are Query Optimizers, Really? | 2016 | VLDB |
| 9 | 4,346 | Estimating Compilation Time of a Query Optimizer | 2003 | SIGMOD |
| 10 | 2,627 | The Complexity of Transformation-Based Join Enumeration | 1997 | VLDB |