DBScholar

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
2423
Venue
SIGMOD
Year
1987
Pagerank
7.8532781e-05
Overall Rank
3,011 | 79.35%
DOI
10.1145/38713.38756

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{richardson_sigmod87,
        title = {{Design and Evaluation of Parallel Pipelined Join Algorithms}},
        author = {Richardson, James P and Lu, Hongjun and Mikkilineni, Krishna},
        series = {{SIGMOD} '87},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/38713.38756},
        url = {https://dl.acm.org/doi/10.1145/38713.38756},
        year = {1987}
}

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