{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T12:52:10Z","timestamp":1774702330257,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210474","type":"print"},{"value":"9783540245711","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_60","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"670-681","source":"Crossref","is-referenced-by-count":26,"title":["LFU-K: An Effective Buffer Management Replacement Algorithm"],"prefix":"10.1007","author":[{"given":"Leonid B.","family":"Sokolinsky","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"60_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/321623.321632","volume":"18","author":"A.V. Aho","year":"1971","unstructured":"Aho, A.V., Denning, P.J., Ullman, J.D.: Principles of Optimal Page Replacement. Journal of the ACM\u00a018(1), 80\u201393 (1971)","journal-title":"Journal of the ACM"},{"issue":"2","key":"60_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L.A. Belady","year":"1966","unstructured":"Belady, L.A.: A Study of Replacement Algorithms for Virtual-Storage Computer. IBM Systems Journal\u00a05(2), 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"key":"60_CR3","first-page":"127","volume-title":"In: VLDB 1985, Proceedings of 11th International Conference on Very Large Data Bases","author":"H.-T. Chou","year":"1985","unstructured":"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\u2013141. Morgan Kaufmann, San Francisco (1985)"},{"key":"60_CR4","volume-title":"Operating Systems Theory","author":"E.G. Coffman","year":"1973","unstructured":"Coffman, E.G., Denning, P.J.: Operating Systems Theory. Prentice-Hall, Englewood Cliffs (1973)"},{"issue":"4","key":"60_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W. Effelsberg","year":"1984","unstructured":"Effelsberg, W., Haerder, T.: Principles of Database Buffer Management. ACM Trans. on Database Systems\u00a09(4), 560\u2013595 (1984)","journal-title":"ACM Trans. on Database Systems"},{"issue":"4","key":"60_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/271074.271094","volume":"26","author":"J. Gray","year":"1997","unstructured":"Gray, J., Graefe, G.: The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. SIGMOD Record\u00a026(4), 63\u201368 (1997)","journal-title":"SIGMOD Record"},{"issue":"2","key":"60_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1147\/sj.22.0112","volume":"2","author":"W.P. Heising","year":"1963","unstructured":"Heising, W.P.: Note on Random Addressing Techniques. IBM Systems Journal\u00a02(2), 112\u2013116 (1963)","journal-title":"IBM Systems Journal"},{"key":"60_CR8","first-page":"439","volume-title":"VLDB 1994, Proceedings of 20th International Conference on Very Large Data Bases","author":"T. Johnson","year":"1994","unstructured":"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\u2013450. Morgan Kaufmann, San Francisco (1994)"},{"key":"60_CR9","series-title":"Fundamental Algorithms","first-page":"700","volume-title":"Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Art of Computer Programming, 3rd edn. Fundamental Algorithms, vol.\u00a01, p. 700. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"60_CR10","series-title":"Sorting and Searching","first-page":"780","volume-title":"Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Art of Computer Programming, 2nd edn. Sorting and Searching, vol.\u00a03, p. 780. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"60_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013143 (1999)","DOI":"10.1145\/301464.301487"},{"issue":"2","key":"60_CR12","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.92.0078","volume":"9","author":"R.L. Mattson","year":"1970","unstructured":"Mattson, R.L., et al.: Evaluation techniques for storage hierarchies. IBM Systems Journal\u00a09(2), 78\u2013117 (1970)","journal-title":"IBM Systems Journal"},{"key":"60_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/170035.170081","volume-title":"Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data","author":"E.J. O\u2019Neil","year":"1993","unstructured":"O\u2019Neil, E.J., O\u2019Neil, 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\u2013306. ACM Press, New York (1993)"},{"issue":"1","key":"60_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/300515.300518","volume":"46","author":"E.J. O\u2019Neil","year":"1999","unstructured":"O\u2019Neil, E.J., O\u2019Neil, P.E., Weikum, G.: An optimality proof of the LRU-K page replacement algorithm. Journal of the ACM\u00a046(1), 92\u2013112 (1999)","journal-title":"Journal of the ACM"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013142 (1990)","DOI":"10.1145\/98457.98523"},{"issue":"4","key":"60_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1145\/7239.7336","volume":"11","author":"G.M. Sacco","year":"1986","unstructured":"Sacco, G.M., Schkolnick, M.: Buffer management in relational database systems. ACM Transactions on Database Systems (TODS)\u00a011(4), 473\u2013498 (1986)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"2","key":"60_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"60_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013133 (1999)","DOI":"10.1145\/301453.301486"},{"key":"60_CR19","first-page":"115","volume-title":"Proceedings of 12th International DEXA Workshop","author":"L.B. Sokolinsky","year":"2001","unstructured":"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\u2013120. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"6","key":"60_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1012706401123","volume":"27","author":"L.B. Sokolinsky","year":"2001","unstructured":"Sokolinsky, L.B.: Organization of Parallel Query Processing in Multiprocessor Database Machines with Hierarchical Architecture. Programming and Computer Software\u00a027(6), 297\u2013308 (2001)","journal-title":"Programming and Computer Software"},{"key":"60_CR21","unstructured":"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"},{"issue":"7","key":"60_CR22","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/358699.358703","volume":"24","author":"M. Stonebraker","year":"1981","unstructured":"Stonebraker, M.: Operating System Support for Database Management. Communications of the ACM\u00a024(7), 412\u2013418 (1981)","journal-title":"Communications of the ACM"},{"key":"60_CR23","first-page":"346","volume-title":"The theory of the Riemann zeta-function","author":"E.C. Titchmarsh","year":"1951","unstructured":"Titchmarsh, E.C.: The theory of the Riemann zeta-function, 2nd edn., p. 346. Oxford University Press, Oxford (1951)","edition":"2"},{"key":"60_CR24","volume-title":"Human Behavior and the Principle of Least Effort: an Introduction to Human Ecology","author":"G.K. Zipf","year":"1949","unstructured":"Zipf, G.K.: Human Behavior and the Principle of Least Effort: an Introduction to Human Ecology. Addison-Wesley, Reading (1949)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24571-1_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:42:16Z","timestamp":1559914936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}