Database Paper Browser

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
2099
Venue
SIGMOD
Year
1979
Pagerank
4.1945683e-05
Overall Rank
13,074 | 9.05%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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
317 Distributed Query Processing In A Relational Data Base System 1978 SIGMOD 0.00027980992
874 Index Selection in a Self-Adaptive Data Base Management System 1976 SIGMOD 0.00015728533
Previous Page 1 / 1 Next

Semantically Similar Papers