Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
Summary: Segmented right-deep trees enable pipelined hash-join execution on multiprocessor DBMS. A pipeline-segment model with heuristic plan selection yields flexible, higher-performance plans with no plan-execution overhead, beating traditional right-deep schemes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ming-Syan Chen (International Business Machines T. J. Watson Research Center)
- 2. Mingling Lo (University of Michigan)
- 3. Philip S. Yu (IBM)
- 4. Honesty C. Young (IBM)
BibTeX Citation
@article{chen_vldb92,
title = {{Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins}},
author = {Chen, Ming-Syan and Lo, Mingling and Yu, Philip S. and Young, Honesty C.},
journal = {PVLDB},
series = {{VLDB} '92},
year = {1992}
}
Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 152 | Multiprocessor Hash-Based Join Algorithms | 1985 | VLDB | 0.00029038365 |
| 242 | A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment | 1989 | SIGMOD | 0.00023604323 |
| 497 | The Design of XPRS | 1988 | VLDB | 0.00017462492 |
| 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 |
| 904 | Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines | 1990 | VLDB | 0.00013319798 |
| 2,470 | Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory | 1990 | VLDB | 8.5330174e-05 |
| 3,011 | Design and Evaluation of Parallel Pipelined Join Algorithms | 1987 | SIGMOD | 7.8532781e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,612 | Memory Efficient Scheduling of Query Pipeline Execution | 2022 | CIDR |
| 2 | 5,443 | Generalized Hash Teams for Join and Group-by | 1999 | VLDB |
| 3 | 2,470 | Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory | 1990 | VLDB |
| 4 | 6,515 | Revisiting Pipelined Parallelism in Multi-Join Query Processing | 2005 | VLDB |
| 5 | 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD |
| 6 | 5,014 | Applying Hash Filters to Improving the Execution of Bushy Trees | 1993 | VLDB |
| 7 | 3,011 | Design and Evaluation of Parallel Pipelined Join Algorithms | 1987 | SIGMOD |
| 8 | 3,250 | On Optimal Processor Allocation To Support Pipelined Hash Joins | 1993 | SIGMOD |
| 9 | 904 | Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines | 1990 | VLDB |
| 10 | 4,652 | On Parallel Execution Of Multiple Pipelined Hash Joins | 1994 | SIGMOD |