DBScholar

Back to papers

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)

Paper ID
8144
Venue
VLDB
Year
1990
Pagerank
0.0002141607
Overall Rank
316 | 97.84%
DOI
-

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
246 Automating Physical Database Design in a Parallel Database 2002 SIGMOD 0.00023457421
289 Optimization of Dynamic Query Evaluation Plans 1994 SIGMOD 0.00022278876
290 An Overview of Query Optimization in Relational Systems 1998 PODS 0.0002227038
744 Fundamental Techniques for Order Optimization 1996 SIGMOD 0.00014411295
774 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00014123979
851 Query Optimization in the Presence of Limited Access Patterns 1999 SIGMOD 0.00013611183
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,727 Optimal Top-Down Join Enumeration 2007 SIGMOD 9.91063e-05
2,093 Reusing Invariants: A New Strategy for Correlated Queries 1998 SIGMOD 9.1831198e-05
2,104 Optimization of Multi-Way Join Queries for Parallel Execution 1991 VLDB 9.1594086e-05
2,202 Quantifying TPC-H Choke Points and Their Optimizations 2020 VLDB 8.9639459e-05
2,275 Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs 2013 VLDB 8.8196821e-05
2,276 Shared Workload Optimization 2014 VLDB 8.8196376e-05
2,286 Extending the Search Strategy in a Query Optimizer 1991 VLDB 8.8044994e-05
2,540 Multi-Objective Parametric Query Optimization 2015 VLDB 8.45187e-05
2,597 The MemSQL Query Optimizer: A modern optimizer for real-time analytics in a distributed database 2016 VLDB 8.3604418e-05
2,627 The Complexity of Transformation-Based Join Enumeration 1997 VLDB 8.3284491e-05
2,694 Holistic Twig Joins on Indexed XML Documents 2003 VLDB 8.2469414e-05
2,762 Cost-based or Learning-based? A Hybrid Query Optimizer for Query Plan Selection 2022 VLDB 8.1539867e-05
2,996 Fast, Randomized Join-Order Selection—Why Use Transformations? 1994 VLDB 7.8745175e-05
3,158 Solving the Join Ordering Problem via Mixed Integer Linear Programming 2017 SIGMOD 7.6888079e-05
3,508 Multi-Join Optimization for Symmetric Multiprocessors 1993 VLDB 7.3566888e-05
3,726 Parallelizing Query Optimization 2008 VLDB 7.1697834e-05
3,779 EROC: A Toolkit for Building NEATO Query Optimizers 1996 VLDB 7.1326925e-05
3,813 Query Simplification: Graceful Degradation for Join-Order Optimization 2009 SIGMOD 7.1051056e-05
3,970 Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer 2000 SIGMOD 6.9835426e-05
4,091 Of Snowstorms and Bushy Trees 2014 VLDB 6.9090244e-05
4,346 Estimating Compilation Time of a Query Optimizer 2003 SIGMOD 6.7510183e-05
4,849 Bitvector-aware Query Optimization for Decision Support Queries 2020 SIGMOD 6.4803828e-05
6,018 Dependency-Aware Reordering for Parallelizing Query Optimization in Multi-Core CPUs 2009 SIGMOD 6.0060585e-05
6,164 On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) 1997 PODS 5.9532278e-05
6,340 Optimizing Join Enumeration in Transformation-based Query Optimizers 2014 VLDB 5.9071133e-05
7,495 On the Calculation of Optimality Ranges for Relational Query Execution Plans 2018 SIGMOD 5.6041473e-05
7,882 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD 5.5237338e-05
8,163 Learned Offline Query Planning via Bayesian Optimization 2025 SIGMOD 5.4751517e-05
8,400 The Fittest Survives: An Adaptive Approach to Query Optimization 1995 VLDB 5.4331924e-05
9,042 DPconv: Super-Polynomially Faster Join Ordering 2024 SIGMOD 5.3256042e-05
9,446 Parallelizing Query Optimization on Shared-Nothing Architectures 2016 VLDB 5.2667452e-05
10,106 How to Optimize SQL Queries? A Comparison Between Split, Holistic, and Hybrid Approaches 2025 VLDB 5.1435736e-05
10,232 EncoderForge: Generating Efficient SQL for Encoders in Machine Learning Inference Pipelines 2026 SIGMOD 5.093636e-05
11,819 Towards Multi-way Join Aware Optimizer in SAP HANA 2020 VLDB 5.093636e-05
11,930 Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products" 2018 VLDB 5.093636e-05
12,938 TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer 1998 VLDB 5.093636e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers