Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Effelsberg W, Haerder T. Principles of database buffer management. ACM Trans Database Syst. 1984;9(4):560–95.
Coffman EG Jr, Denning PJ. Operating systems theory. Englewood Cliffs: Prentice-Hall; 1973.
Cai FF, Hull MEC, Bell DA. Buffer management for high performance database systems. In: Proceedings of the High-Performance Computing on the Information Superhighway; 1997. p. 633–8.
O’Neil EJ, O’Neil PE, Weikum G. The LRU-K page replacement algorithm for database disk buffering. In: Proceedings of ACM SIGMOD Conference; 1993. p. 297–306.
Johnson T, Shasha D. 2Q: a low overhead high performance buffer management replacement algorithm. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 439–50.
Lee D, Choi J, Kim J-H, Noh SH, Min SL, Cho Y, Kim CS. On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. In: Proceedings of ACM SIGMETRICS Conference; 1999. p. 134–43.
Sacco GM, Schkolnick M. A mechanism for managing the buffer pool in a relational database system using the hot set model. In: Proceedings of the 8th International Conference on Very Data Bases; 1982. p. 257–62.
Sacco GM, Schkolnick M. Buffer management in relational database systems. ACM Trans Database Syst. 1986;11(4):473–98.
Chou H-T, DeWitt DJ. An evaluation of buffer management strategies for relational database systems. In: Proceedings of the 11th International Conference on Very Large Data Bases; 1985. p. 174–88.
Belady LA. A study of replacement algorithms for a virtual-storage computer. IBM Syst J. 1966;5(2):78–101.
Sacco GM. Index access with a finite buffer. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987. p. 301–9.
Kim W. A new way to compute the product and join of relations. In: Proceedings of 1980 ACM SIGMOD Conference; 1980. p. 179–87.
Sacco GM. Fragmentation: a technique for efficient query processing. ACM Trans Database Syst. 1986;11(2):113–33.
Ng R, Faloutsos C, Sellis T. Flexible buffer allocation based on marginal gains. In: Proceedings of ACM SIGMOD Conference; 1991. p. 387–96.
Storm AJ, Garcia-Arellano C, Lightstone SS, Diao Y, Surendra M. Adaptive self-tuning memory in DB2. In: Proceedings of the 32nd International Conference on Very Large Data Bases; 2006. p. 1081–92.
Goh L, Shu Y, Huang Z, Ooi C. Dynamic buffer management with extensible replacement policies. VLDB J. 2006;15(2):99–120.
Kemper A, Kossmann D. Dual-buffering strategies in object bases. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 427–38.
Corral A, Vassilakopoulos M, Manolopoulos Y. The impact of buffering on closest pairs queries using R-trees. In: Proceedings of the 5th East European Conference on Advances in Databases and Information Systems; 2001. p. 41–54.
Gu X, Ding C. A generalized theory of collaborative caching. SIGPLAN Not. 2012;47(11):109–20.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Sacco, G.M. (2018). Buffer Management. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_858
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_858
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering