Database Paper Browser

Back to papers

Design and Evaluation of Parallel Pipelined Join Algorithms

Summary: Parallel, pipelined join algorithms for DBMSs: sort-merge, hashing, hybrids. Analytical analysis shows hash-partitioning reduces time; hash methods beat sort-merge in cases, with replication of the smaller relation and shared memory providing gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2361
Venue
SIGMOD
Year
1987
Pagerank
8.3924401e-05
Overall Rank
2,640 | 81.64%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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