Back to papers
Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization
Summary: Analyzes cost landscapes of left-deep vs. bushy query-tree spaces, showing both form a well with distinct quality. Evaluates Iterative Improvement, Simulated Annealing, and Two-Phase Optimization on these spaces, concluding the combined space is easier to optimize.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 2525
- Venue
- SIGMOD
- Year
- 1991
- Pagerank
- 0.0001639584
- Overall Rank
- 813 | 94.35%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 28 of 28 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 285 |
Automating Physical Database Design in a Parallel Database |
2002 |
SIGMOD |
0.0002899128 |
| 876 |
Parametric Query Optimization |
1992 |
VLDB |
0.00015716096 |
| 978 |
Rapid Bushy Join-order Optimization with Cartesian Products |
1996 |
SIGMOD |
0.00014881073 |
| 1,847 |
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins |
1992 |
VLDB |
0.00010333796 |
| 2,377 |
CS2: A New Database Synopsis for Query Estimation |
2013 |
SIGMOD |
8.9402115e-05 |
| 2,765 |
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces |
1993 |
VLDB |
8.1572726e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 2,869 |
The Complexity of Transformation-Based Join Enumeration |
1997 |
VLDB |
7.9808408e-05 |
| 3,048 |
Fast, Randomized Join-Order Selection — Why Use Transformations? |
1994 |
VLDB |
7.6543116e-05 |
| 3,053 |
Multiple Join Size Estimation by Virtual Domains (extended abstract) |
1993 |
PODS |
7.64969e-05 |
| 3,422 |
Multi-Join Optimization for Symmetric Multiprocessors |
1993 |
VLDB |
7.1134801e-05 |
| 3,515 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
7.0220813e-05 |
| 3,560 |
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer |
2000 |
SIGMOD |
6.9723858e-05 |
| 3,885 |
Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations |
2022 |
VLDB |
6.6674822e-05 |
| 4,152 |
openGauss: An Autonomous Database System |
2021 |
VLDB |
6.4060406e-05 |
| 4,397 |
Estimating Compilation Time of a Query Optimizer |
2003 |
SIGMOD |
6.2230918e-05 |
| 4,404 |
A Decomposition-Based Simulated Annealing Technique for Data Clustering |
1994 |
PODS |
6.2167147e-05 |
| 4,511 |
Of Snowstorms and Bushy Trees |
2014 |
VLDB |
6.1247645e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 4,781 |
On Parallel Execution Of Multiple Pipelined Hash Joins |
1994 |
SIGMOD |
5.9261504e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,097 |
Join Query Optimization Techniques for Complex Event Processing Applications |
2018 |
VLDB |
5.7011496e-05 |
| 5,300 |
Applying Hash Filters To Improving The Execution Of Bushy Trees |
1993 |
VLDB |
5.5793265e-05 |
| 6,081 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2208051e-05 |
| 6,543 |
On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) |
1997 |
PODS |
5.0208799e-05 |
| 7,729 |
Processing and Optimization of Multiway Spatial Joins Using R-trees |
1999 |
PODS |
4.6660821e-05 |
| 8,194 |
The Fittest Survives: An Adaptive Approach to Query Optimization |
1995 |
VLDB |
4.5618179e-05 |
| 8,725 |
A Fast Randomized Algorithm for Multi-Objective Query Optimization |
2016 |
SIGMOD |
4.4600243e-05 |
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.
Semantically Similar Papers