LFU-K: An effective buffer management replacement algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2973, Issue , 2004, Pages 670-681

  Sokolinsky, Leonid B ^a  

^a CHELYABINSK STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS;

BUFFER MANAGEMENT; BUFFERING ALGORITHM; FORMAL DESCRIPTION; LEAST FREQUENTLY USED; PAGE REPLACEMENT ALGORITHMS; PROBABILITY MODELING; REPLACEMENT ALGORITHM; TRACE DRIVEN SIMULATION;

ALGORITHMS;

EID: 35048841791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24571-1_60     Document Type: Article

References (24)

1. Aho A.V., Denning P.J., Ullman J.D. Principles of Optimal Page Replacement // Journal of the ACM. 1971.Vol. 18. No. 1. P. 80-93.
2. Belady L.A. A Study of Replacement Algorithms for Virtual-Storage Computer // IBM Systems Journal. 1966. Vol. 5. No. 2. P. 78-101.
3. Chou H.-T., DeWitt D.J. An Evaluation of Buffer Management Strategies for Relational Database Systems // VLDB'85, Proceedings of 11th International Conference on Very Large Data Bases, August 21-23, 1985, Stockholm, Sweden. Morgan Kaufmann. 1985. P. 127-141.
4. Coffman E.G., Denning P.J. Operating Systems Theory. Prentice-Hall, 1973.
5. Effelsberg W., Haerder T. Principles of Database Buffer Management // ACM Trans, on Database Systems. Dec. 1984. Vol. 9. No. 4. P. 560-595.
6. Gray J., Graefe G. The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb // SIGMOD Record. 1997. Vol. 26. No. 4. P. 63-68.
7. Heising W.P. Note on Random Addressing Techniques // IBM Systems Journal. 1963. Vol. 2. No. 2. P. 112-116.
8. Johnson T., Shasha D. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm // VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile. Morgan Kaufmann. 1994. P. 439-450.
9. Knuth D.E. Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition). Addison-Wesley, 1997. 700 p.
10. Knuth D.E. Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition). Addison-Wesley, 1998. 780 p.
11. Lee D., Choi J., Kim J.-H., Noh S.H., Min S.L., Cho Y., Kim C.-S. On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies // SIGMETRICS '99, International Conference on Measurement and Modeling of Computer Systems, May 1-4, 1999, Atlanta, Georgia, USA, Proceedings. 1999. P. 134-143.
12. Mattson R.L., et al. Evaluation techniques for storage hierarchies // IBM Systems Journal. 1970. Vol. 9. No. 2. P. 78-117.
13. O'Neil E.J., O'Neil P.E., Weikum G. The LRU-K Page Replacement Algorithm For Database Disk Buffering // Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993. ACM Press. 1993. P. 297-306.
14. O'Neil E.J., O'Neil P.E., Weikum C. An optimality proof of the LRU-K page replacement algorithm // Journal of the ACM. 1999. Vol. 46. No. 1. P. 92-112.
15. Robinson J.T., Devarakonda M.V. Data Cache Management Using Frequency-Based Replacement // 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, University of Colorado, Boulder, Colorado, USA, May 22-25, 1990, Proceedings. 1990. P. 134-142.
16. Sacco G. M., Schkolnick M. Buffer management in relational database systems // ACM Transactions on Database Systems (TODS). Dec. 1986. Vol. 11. No. 4. P. 473-498
17. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules // Communications of the ACM. 1985. Vol. 28. No. 2. P. 202-208.
18. Smaragdakis Y., Kaplan S., Wilson P.R. EELRU: Simple and Effective Adaptive Page Replacement // SIGMETRICS '99, International Conference on Measurement and Modeling of Computer Systems, May 1-4, 1999, Atlanta, Georgia, USA, Proceedings. 1999. P. 122-133.
19. Sokolinsky L.B. Design and Evaluation of Database Multiprocessor Architecture with High Data Availability // 12th International DEXA Workshop, Munich, Germany, 3-7 September, 2001, Proceedings. IEEE Computer Society. 2001. P. 115-120.
20. Sokolinsky L.B. Organization of Parallel Query Processing in Multiprocessor Database Machines with Hierarchical Architecture // Programming and Computer Software. 2001. Vol. 27. No. 6. P. 297-308.
21. Sokolinsky L.B. Page Replacement Algorithm for Buffer Management in the Omega Parallel Database System. Technical report EGA08. Chelyabinsk State University, 2003. [http://www.csu.ru/~sok/papers/sources/omega08.pdf]
22. Stonebraker M. Operating System Support for Database Management // Communications of the ACM. 1981. Vol. 24. No. 7. P. 412-418.
23. Titchmarsh E.C. The theory of the Riemann zeta-function; second edition. Oxford University Press, 1951. 346 p.
24. Zipf G.K. Human Behavior and the Principle of Least Effort: an Introduction to Human Ecology. Reading, MA, Addison-Wesley, 1949.