Applying Hash Filters to Improving the Execution of Bushy Trees

Summary: Interleaves hash filters with bushy-tree multi-join execution to reduce intermediate results. Derives a join-order-driven filter sequence that balances pruning effectiveness and construction/application cost, with simulations showing increasing gains as query width grows. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 8342
Venue: VLDB
Year: 1993
Pagerank: 6.4002123e-05
Overall Rank: 5,014 | 65.61%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Ming-Syan Chen (IBM)
2. Hui-I Hsiao (IBM)
3. Philip S. Yu (IBM)

BibTeX Citation

@article{chen_vldb93,
        title = {{Applying Hash Filters to Improving the Execution of Bushy Trees}},
        author = {Chen, Ming-Syan and Hsiao, Hui-I and Yu, Philip S.},
        journal = {PVLDB},
        series = {{VLDB} '93},
        pages = {505},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,652	On Parallel Execution Of Multiple Pipelined Hash Joins	1994	SIGMOD	6.5851924e-05
4,849	Bitvector-aware Query Optimization for Decision Support Queries	2020	SIGMOD	6.4803828e-05
5,284	SQLite: Past, Present, and Future	2022	VLDB	6.2827906e-05
8,074	Parachute: Single-Pass Bi-Directional Information Passing	2025	VLDB	5.4929961e-05
8,439	New Query Optimization Techniques in the Spark Engine of Azure Synapse	2022	VLDB	5.4248071e-05
9,279	Including Bloom Filters in Bottom-up Optimization	2025	SIGMOD	5.2934632e-05
10,985	Scaling GPU-Accelerated Databases beyond GPU Memory Size	2025	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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.0024089429
143	Optimization of Nonrecursive Queries	1986	VLDB	0.0002959213
242	A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment	1989	SIGMOD	0.00023604323
463	Optimization of Large Join Queries	1988	SIGMOD	0.00018064961
698	Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques	1989	SIGMOD	0.00014879675
708	Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization	1991	SIGMOD	0.00014727576
830	Exploiting Inter-Operation Parallelism in XPRS	1992	SIGMOD	0.00013761367
1,720	Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins	1992	VLDB	9.9265634e-05
2,104	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB	9.1594086e-05
3,250	On Optimal Processor Allocation To Support Pipelined Hash Joins	1993	SIGMOD	7.597429e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,779	An Adaptive Hash Join Algorithm for Multiuser Environments	1990	VLDB
2	2,470	Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory	1990	VLDB
3	6,207	The 3D Hash Join: Building On Non-Unique Join Attributes	2022	CIDR
4	360	Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs	2011	SIGMOD
5	152	Multiprocessor Hash-Based Join Algorithms	1985	VLDB
6	5,663	Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results	2005	VLDB
7	5,443	Generalized Hash Teams for Join and Group-by	1999	VLDB
8	904	Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines	1990	VLDB
9	1,720	Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins	1992	VLDB
10	4,652	On Parallel Execution Of Multiple Pipelined Hash Joins	1994	SIGMOD