Abstract
This paper introduces a new approach to database disk buffering, called the LFU- K method. The LFU- K page replacement algorithm is an improvement to the Least Frequently Used (LFU) algorithm. The paper proposes a theoretical-probability model for formal description of LFU- K algorithm. Using this model we evaluate estimations for the LFU- K parameters. This paper also describes an implementation of LFU-2 policy. As we demonstrate by trace-driven simulation experiments, the LFU-2 algorithm provides significant improvement over conventional buffering algorithms for the shared-nothing database systems.
by the Russian Foundation for Basic Research under Grant 03-07-90031.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A.V., Denning, P.J., Ullman, J.D.: Principles of Optimal Page Replacement. Journal of the ACM 18(1), 80–93 (1971)
Belady, L.A.: A Study of Replacement Algorithms for Virtual-Storage Computer. IBM Systems Journal 5(2), 78–101 (1966)
Chou, H.-T., DeWitt, D.J.: An Evaluation of Buffer Management Strategies for Relational Database Systems. In: In: VLDB 1985, Proceedings of 11th International Conference on Very Large Data Bases, Stockholm, Sweden, August 21-23, pp. 127–141. Morgan Kaufmann, San Francisco (1985)
Coffman, E.G., Denning, P.J.: Operating Systems Theory. Prentice-Hall, Englewood Cliffs (1973)
Effelsberg, W., Haerder, T.: Principles of Database Buffer Management. ACM Trans. on Database Systems 9(4), 560–595 (1984)
Gray, J., Graefe, G.: The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. SIGMOD Record 26(4), 63–68 (1997)
Heising, W.P.: Note on Random Addressing Techniques. IBM Systems Journal 2(2), 112–116 (1963)
Johnson, T., Shasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: VLDB 1994, Proceedings of 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, September 12-15, pp. 439–450. Morgan Kaufmann, San Francisco (1994)
Knuth, D.E.: Art of Computer Programming, 3rd edn. Fundamental Algorithms, vol. 1, p. 700. Addison-Wesley, Reading (1997)
Knuth, D.E.: Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3, p. 780. Addison-Wesley, Reading (1998)
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. In: SIGMETRICS 1999, Proceedings of International Conference on Measurement and Modeling of Computer Systems, Atlanta, Georgia, USA, May 1-4, pp. 134–143 (1999)
Mattson, R.L., et al.: Evaluation techniques for storage hierarchies. IBM Systems Journal 9(2), 78–117 (1970)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K Page Replacement Algorithm For Database Disk Buffering. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, pp. 297–306. ACM Press, New York (1993)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: An optimality proof of the LRU-K page replacement algorithm. Journal of the ACM 46(1), 92–112 (1999)
Robinson, J.T., Devarakonda, M.V.: Data Cache Management Using Frequency-Based Replacement. In: Proceedings of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, University of Colorado, Boulder, Colorado, USA,, May 22-25, pp. 134–142 (1990)
Sacco, G.M., Schkolnick, M.: Buffer management in relational database systems. ACM Transactions on Database Systems (TODS) 11(4), 473–498 (1986)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Smaragdakis, Y., Kaplan, S., Wilson, P.R.: EELRU: Simple and Effective Adaptive Page Replacement. In: SIGMETRICS 1999, Proceedings of International Conference on Measurement and Modeling of Computer Systems, Atlanta, Georgia, USA, May 1-4, pp. 122–133 (1999)
Sokolinsky, L.B.: Design and Evaluation of Database Multiprocessor Architecture with High Data Availability. In: Proceedings of 12th International DEXA Workshop, Munich, Germany, September 3-7, pp. 115–120. IEEE Computer Society, Los Alamitos (2001)
Sokolinsky, L.B.: Organization of Parallel Query Processing in Multiprocessor Database Machines with Hierarchical Architecture. Programming and Computer Software 27(6), 297–308 (2001)
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
Stonebraker, M.: Operating System Support for Database Management. Communications of the ACM 24(7), 412–418 (1981)
Titchmarsh, E.C.: The theory of the Riemann zeta-function, 2nd edn., p. 346. Oxford University Press, Oxford (1951)
Zipf, G.K.: Human Behavior and the Principle of Least Effort: an Introduction to Human Ecology. Addison-Wesley, Reading (1949)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokolinsky, L.B. (2004). LFU-K: An Effective Buffer Management Replacement Algorithm. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive