An Optimality Proof of the LRU-K Page Replacement Algorithm

Journal of the ACM

Volumn 46, Issue 1, 1999, Pages 92-112

  O'Neil, Elizabeth J ^a   O'Neil, Patrick E ^a   Weikum, Gerhard ^b  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Algorithms; Buffering; Design; H.2.2 Database Management : Physical Design; LRU; LRU K; Optimality; Page replacement; Performance; Theory

Indexed keywords

EID: 0007836677     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/300515.300518     Document Type: Article

References (13)

1. AHO, A. V., DENNING, P. J., AND ULLMAN, J. D. 1971. Principles of optimal page replacement. J. ACM 18, 1 (Jan.), 80-93.
2. BELADY, L. A. 1966. A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 2, 78-101.
3. BERRY, D. A., AND LINDGREN, B. W. 1990. Statistics: Theory and Methods. Brooks/Cole Publishing Company.
4. COFFMAN, JR., E. G., AND DENNING, P. J. 1973. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, N.J.
5. DENNING, P. J. 1968. The working set model for program behavior. Commun. ACM 11, 5 (May), 323-333.
6. EFFELSBERG, W., AND HAERDER, T. 1984. Principles of database buffer management. ACM Trans. Datab. Syst. 9, 4 (Dec.), 560-595.
7. GRAY, J., AND PUTZOLU, F. 1987. The 5 minute rule for trading memory for disk accesses and the 10 byte rule for trading memory for CPU time. In Proceedings of the 1987 ACM SIGMOD Conference (San Francisco, Calif., May 27-29). ACM, New York, pp. 395-398.
8. HODGES, JR., J. L., AND LEHMANN, E. L. 1970. Basic Concepts of Probability and Statistics, 2nd Ed. Holden-Day, San Francisco, Calif.
9. JOHNSON, T., AND SHASHA, D. 1994. 2Q: A low-overhead high-performance buffer replacement algorithm. In Proceedings of the 20th VLDB Conference (Sept.), Morgan-Kaufmann, San Francisco, Calif., pp. 439-449.
10. KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. H. 1994. Beyond competitive analysis. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 394-400.
11. O'NEIL, E. J., O'NEIL, P. E., AND WEIKUM, G. 1993. The LRU-K page replacement algorithm for database disk buffering. In Proceedings of the 1993 SIGMOD International Conference on Management of Data (Washington, D.C., May 26-28). ACM, New York, pp 297-306.
12. SLEATOR, D. D., AND TARJAN, R. E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2, (Feb.), 202-208.
13. WEIKUM, G., HASSE, C., MOENKEBERG, A., AND ZABBACK, P. 1994. The comfort automatic tuning project. Inf. Syst. 19, 5 (July), 381-432.