DBScholar

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
2787
Venue
SIGMOD
Year
1994
Pagerank
6.5851924e-05
Overall Rank
4,652 | 68.09%
DOI
10.1145/191839.191879

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hsiao_sigmod94,
        title = {{ON PARALLEL EXECUTION OF MULTIPLE PIPELINED HASH JOINS}},
        author = {Hsiao, Hui-I and Chen, Ming-Syan and Yu, Philip S.},
        series = {{SIGMOD} '94},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/191839.191879},
        url = {https://dl.acm.org/doi/10.1145/191839.191879},
        year = {1994}
}

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