DBScholar

Back to papers

The LRU-K Page Replacement Algorithm For Database Disk Buffering

Summary: LRU-K tracks the last K references per page to estimate interarrival times and drive per-page eviction decisions. Self-tuning with lightweight bookkeeping, it adapts in real time, outperforming conventional buffering and approaching manually tuned, workload-specific pools. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2712
Venue
SIGMOD
Year
1993
Pagerank
0.00023846898
Overall Rank
231 | 98.42%
DOI
10.1145/170035.170081

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{oneill_sigmod93,
        title = {{The LRU-K Page Replacement Algorithm For Database Disk Buffering}},
        author = {O'Neill, Elizabeth J. and O'Neill, Patrick E. and Weikum, Gerhard},
        series = {{SIGMOD} '93},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/170035.170081},
        url = {https://dl.acm.org/doi/10.1145/170035.170081},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 56 citing papers.

Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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