Database Paper Browser

Back to papers

Of Snowstorms and Bushy Trees

Summary: Proposes bushy join-tree optimization for snowstorm queries in Oracle to cut intermediate results and beat left-deep plans. Generates bushy trees via external logical transformations that prune search space, with an algorithm for optimal trees and reported speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10806
Venue
VLDB
Year
2014
Pagerank
6.1247645e-05
Overall Rank
4,511 | 68.62%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059038975
3,154 The MemSQL Query Optimizer: A modern optimizer for real-time analytics in a distributed database 2016 VLDB 7.4686089e-05
4,623 Automated Generation of Materialized Views in Oracle 2020 VLDB 6.0411909e-05
8,432 SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries 2020 SIGMOD 4.5153924e-05
9,726 Cardinality Estimation of LIKE Predicate Queries using Deep Learning 2025 SIGMOD 4.2943379e-05
10,186 NSHEDB: Noise-Sensitive Homomorphic Encrypted Database Query Engine 2026 SIGMOD 4.1945683e-05
11,091 Grouping, Subsumption, and Disjunctive Join Optimizations in Oracle 2024 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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.0040449103
423 Measuring the Complexity of Join Enumeration in Query Optimization 1990 VLDB 0.00023669348
659 The Making of TPC-DS 2006 VLDB 0.00018500853
813 Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization 1991 SIGMOD 0.0001639584
978 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00014881073
1,063 Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines 1990 VLDB 0.00014362773
1,826 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00010400425
2,504 Enhanced Subquery Optimizations in Oracle 2009 VLDB 8.6351917e-05
4,722 Reducing Multidatabase Query Response Time By Tree Balancing 1995 SIGMOD 5.9717332e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
423 Measuring the Complexity of Join Enumeration in Query Optimization 1990 VLDB 0.00023669348
1,619 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011111678
1,063 Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines 1990 VLDB 0.00014362773
8,066 Optimizing Iceberg Queries with Complex Joins 2017 SIGMOD 4.5937212e-05
6,543 On the Complexity of Generating Optimal Plans with Cross Products (extended abstract) 1997 PODS 5.0208799e-05
5,300 Applying Hash Filters To Improving The Execution Of Bushy Trees 1993 VLDB 5.5793265e-05
1,826 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00010400425
11,091 Grouping, Subsumption, and Disjunctive Join Optimizations in Oracle 2024 VLDB 4.1945683e-05
4,722 Reducing Multidatabase Query Response Time By Tree Balancing 1995 SIGMOD 5.9717332e-05
978 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00014881073