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
- 2526
- Venue
- SIGMOD
- Year
- 1991
- Pagerank
- 0.00016385568
- Overall Rank
- 811 | 94.37%
- 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.00028978423 |
| 870 |
Parametric Query Optimization |
1992 |
VLDB |
0.00015709369 |
| 979 |
Rapid Bushy Join-order Optimization with Cartesian Products |
1996 |
SIGMOD |
0.00014871114 |
| 1,851 |
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins |
1992 |
VLDB |
0.00010326646 |
| 2,369 |
CS2: A New Database Synopsis for Query Estimation |
2013 |
SIGMOD |
8.9462051e-05 |
| 2,771 |
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces |
1993 |
VLDB |
8.149365e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 2,878 |
The Complexity of Transformation-Based Join Enumeration |
1997 |
VLDB |
7.9694937e-05 |
| 3,053 |
Fast, Randomized Join-Order Selection — Why Use Transformations? |
1994 |
VLDB |
7.6482987e-05 |
| 3,056 |
Multiple Join Size Estimation by Virtual Domains (extended abstract) |
1993 |
PODS |
7.6459653e-05 |
| 3,424 |
Multi-Join Optimization for Symmetric Multiprocessors |
1993 |
VLDB |
7.1066545e-05 |
| 3,519 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
7.0181381e-05 |
| 3,563 |
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer |
2000 |
SIGMOD |
6.9686532e-05 |
| 3,886 |
Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations |
2022 |
VLDB |
6.6610704e-05 |
| 4,151 |
openGauss: An Autonomous Database System |
2021 |
VLDB |
6.4020605e-05 |
| 4,390 |
Estimating Compilation Time of a Query Optimizer |
2003 |
SIGMOD |
6.2193128e-05 |
| 4,400 |
A Decomposition-Based Simulated Annealing Technique for Data Clustering |
1994 |
PODS |
6.211957e-05 |
| 4,503 |
Of Snowstorms and Bushy Trees |
2014 |
VLDB |
6.131076e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 4,784 |
On Parallel Execution Of Multiple Pipelined Hash Joins |
1994 |
SIGMOD |
5.9205964e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,091 |
Join Query Optimization Techniques for Complex Event Processing Applications |
2018 |
VLDB |
5.7010894e-05 |
| 5,303 |
Applying Hash Filters To Improving The Execution Of Bushy Trees |
1993 |
VLDB |
5.5740327e-05 |
| 6,086 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2157921e-05 |
| 6,541 |
On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) |
1997 |
PODS |
5.0160682e-05 |
| 7,727 |
Processing and Optimization of Multiway Spatial Joins Using R-trees |
1999 |
PODS |
4.6616221e-05 |
| 8,192 |
The Fittest Survives: An Adaptive Approach to Query Optimization |
1995 |
VLDB |
4.5575625e-05 |
| 8,720 |
A Fast Randomized Algorithm for Multi-Objective Query Optimization |
2016 |
SIGMOD |
4.4563359e-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