DBScholar

Back to papers

An Approximation Algorithm For A File-Allocation Problem In A Hierarchical Distributed System.

Summary: NP-hard file allocation in a hierarchical distributed system; introduces an approximation algorithm. Empirical results indicate the solution is within 4% of optimal, suggesting a high probability of near-optimal performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2189
Venue
SIGMOD
Year
1980
Pagerank
5.093636e-05
Overall Rank
13,272 | 8.95%
DOI
10.1145/582250.582270

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{lam_sigmod80,
        title = {{AN APPROXIMATION ALGORITHM FOR A FILE-ALLOCATION PROBLEM IN A HIERARCHICAL DISTRIBUTED SYSTEM.}},
        author = {Lam, K. and Yu, C. T.},
        series = {{SIGMOD} '80},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582250.582270},
        url = {https://dl.acm.org/doi/10.1145/582250.582270},
        year = {1980}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
13,256 File Allocation in Distributed Databases with Interaction between Files 1983 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4,388 Data Base Decomposition In A Hierarchical Computer System 1975 SIGMOD 6.7308761e-05
Previous Page 1 / 1 Next

Semantically Similar Papers