Rapid Bushy Join-order Optimization with Cartesian Products
Summary: Full bushy join-order search, including subplan Cartesian products, is feasible in seconds for up to 15 relations, challenging standard optimizer exclusions. Join-order enumeration is decoupled from predicate analysis, with novel techniques and a benchmarking framework. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Bennet Vance (Oregon Graduate Institute)
- 2. David Maier (Oregon Graduate Institute)
BibTeX Citation
@inproceedings{vance_sigmod96,
title = {{Rapid Bushy Join-order Optimization with Cartesian Products}},
author = {Vance, Bennet and Maier, David},
series = {{SIGMOD} '96},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/233269.233317},
url = {https://dl.acm.org/doi/10.1145/233269.233317},
year = {1996}
}Incoming Citations (Sorted by Pagerank)
Showing 29 of 29 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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.0023947656 |
| 125 | Predicate Migration: Optimizing Queries with Expensive Predicates | 1993 | SIGMOD | 0.00030470848 |
| 321 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB | 0.00021088704 |
| 725 | Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization | 1991 | SIGMOD | 0.00014465736 |
| 3,042 | Fast, Randomized Join-Order Selection—Why Use Transformations? | 1994 | VLDB | 7.7213044e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,016 | Faster Plan Generation through Consideration of Functional Dependencies and Keys | 2016 | VLDB |
| 2 | 10,508 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |
| 3 | 2,516 | Optimization of Queries with User-defined Predicates | 1996 | VLDB |
| 4 | 8,039 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD |
| 5 | 1,186 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 6 | 13,374 | Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract) | 1992 | PODS |
| 7 | 321 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB |
| 8 | 8,462 | On the Optimality of Strategies for Multiple Joins | 1990 | PODS |
| 9 | 6,110 | On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) | 1997 | PODS |
| 10 | 15 | How Good Are Query Optimizers, Really? | 2016 | VLDB |