DBScholar

Back to papers

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)

Paper ID
2689
Venue
SIGMOD
Year
1993
Pagerank
7.597429e-05
Overall Rank
3,250 | 77.71%
DOI
10.1145/170035.170053

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lo_sigmod93,
        title = {{ON OPTIMAL PROCESSOR ALLOCATION TO SUPPORT PIPELINED HASH JOINS}},
        author = {Lo, Ming-Ling and Chen, Ming-Syan and Ravishankar, C. V. and Yu, Philip S.},
        series = {{SIGMOD} '93},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/170035.170053},
        url = {https://dl.acm.org/doi/10.1145/170035.170053},
        year = {1993}
}

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.

Previous Page 1 / 1 Next

Semantically Similar Papers