On Optimal Processor Allocation To Support Pipelined Hash Joins
Summary: Optimal processor allocation for pipelined hash joins in multiprocessor DBs; three optimal schemes under different constraints. Two-phase mini-max formulation (build, probe) for minimizing execution time; validated by tuple-by-tuple simulation; generalizable to two-phase resource allocations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ming-Ling Lo
- 2. Ming-Syan Chen
- 3. C. V. Ravishankar
- 4. Philip S. Yu
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 78 | Multiprocessor Hash-Based Join Algorithms | 1985 | VLDB | 0.00056413752 |
| 463 | The Design Of Xprs | 1988 | VLDB | 0.00022464669 |
| 807 | Exploiting Inter-Operation Parallelism in XPRS | 1992 | SIGMOD | 0.00016434207 |
| 1,063 | Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines | 1990 | VLDB | 0.00014362773 |
| 1,847 | Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins | 1992 | VLDB | 0.00010333796 |
| 2,619 | Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory | 1990 | VLDB | 8.4431973e-05 |
Previous
Page 1 / 1
Next