DBScholar

Back to papers

Performance Analysis Of Three Related Assignment Problems

Summary: Three data-placement problems are analyzed via occupancy theory: device assignment to minimize completion time; page/block placement to minimize block accesses. Hashing with nonuniform bucket probabilities is examined, with optimal solutions obtained from the same occupancy framework. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2161
Venue
SIGMOD
Year
1979
Pagerank
5.093636e-05
Overall Rank
13,275 | 8.93%
DOI
10.1145/582095.582109

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{yu_sigmod79,
        title = {{PERFORMANCE ANALYSIS OF THREE RELATED ASSIGNMENT PROBLEMS}},
        author = {Yu, C.T. and Siu, M.K. and Lam, K. and Ozsoyoglu, M.},
        series = {{SIGMOD} '79},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582095.582109},
        url = {https://dl.acm.org/doi/10.1145/582095.582109},
        year = {1979}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
386 Distributed Query Processing In A Relational Data Base System 1978 SIGMOD 0.00019451022
854 Index Selection in a Self-Adaptive Data Base Management System 1976 SIGMOD 0.00013581028
Previous Page 1 / 1 Next

Semantically Similar Papers