Database Paper Browser

Back to papers

On Parallel Execution Of Multiple Pipelined Hash Joins

Summary: Parallel execution of multiple pipelined hash joins; transforms a bushy execution tree into an allocation tree to allocate processors by synchronous execution time, balancing inner hash-table availability. Hash filtering is explored to boost throughput; simulations show allocation-tree schemes outperform bushy-tree, with filters becoming more beneficial as the number of relations grows. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2725
Venue
SIGMOD
Year
1994
Pagerank
5.9261504e-05
Overall Rank
4,781 | 66.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers