Flexible and Adaptable Buffer Management Techniques for Database Management Systems

IEEE Transactions on Computers

Volumn 44, Issue 4, 1995, Pages 546-560

  Faloutsos, Christos ^a   Ng, Raymond ^b   Sellis, Timos ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Buffer management; performance analysis; relational databases

Indexed keywords

ALGORITHMS; BUFFER STORAGE; DATA ACQUISITION; DATA HANDLING; PERFORMANCE; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER);

BUFFER MANAGEMENT; MARGINAL GAINS;

RELATIONAL DATABASE SYSTEMS;

EID: 0029293845     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.376169     Document Type: Article

References (18)

1. A.F. Cardenas, “Analysis and performance of inverted data base structures,” Comtn. of the ACM, vol. 18, no. 5, 1975.
2. H. Chou, “Buffer management of database systems,” Computer Sciences Technical Report 597, Univ. of Wisconsin, Madison, 1985.
3. H. Chou and D. DeWitt, “An evaluation of buffer management strategies for relational database systems,” Proc. 11th Int'l Conf. Very Large Data Bases, 1985.
4. S. Christodoulakis, “Implication of certain assumptions in data base performance evaluation,” ACM Trans. Database Systems, vol. 9, no. 2, 1984.
5. D. Cornell and P. Yu, “Integration of buffer management and query optimization in relational database environment,” Proc. 15th Int'l Conf. Very Large Data Bases, 1989.
6. W. Effelsberg and T. Haerder, “Principles of Database Buffer Management,” ACM Trans. Database Systems, vol. 9, no. 4, 1984.
7. C. Faloutsos, R. Ng, and T. Sellis,. “Predictive load control for Flexible buffer allocation,” Proc. 17th Int'l Conf. Very Large Data Bases, pp. 265-274, 1991.
8. J. Kaplan, “Buffer management policies in a database environment,” Master thesis, Univ. of California, Berkeley, 1980.
9. E. Kauder, History of Marginal Utility Theory, Princeton, NJ: Princeton Univ. Press, 1965.
10. T. Lang, C. Wood, and E. Fernandez, “Database buffer paging in virtual storage systems,” ACM Trans. Database Systems, vol. 2, no. 4, 1977.
11. R. Mattson, J. Gecsei, D. Slutz, and I. Traiger, “Evaluation techniques for storage hierarchies,” IBM Systems Journal, vol. 9, no. 2, 1970.
12. R. Ng, C. Faloutsos, and T. Sellis, “Flexible buffer allocation based on marginal gains,” Proc. ACM SIGMOD Int'l Conf., Management of Data, pp. 387-396, 1991.
13. G. Sacca and M. Schkolnick, “A mechanism for managing the buffer pool in a relational database system using the hot set model,” Proc. Eighth Int'l Conf Very Large Data Bases, 1982.
14. G. Sacca and M. Schkolnick, “Buffer Management in Relational Database Systems,” ACM Trans. Database Systems, vol. 11, no. 4, 1986.
15. S. Sherman and R. Brice, “Performance of a database manager in a virtual memory system,” ACM Trans. Database Systems, vol. 1, no. 4, 1976.
16. M. Stonebraker, E. Wong, and P. Kreps, “The design and implementation of INGRES,” ACM Trans. Database Systems, vol. 1, no. 3, 1976.
17. K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications, Englewood Cliffs, NJ: Prentice Hall, Inc., 1982.
18. S. Yao, “Approximating block accesses in database organizations,” Comm. of the ACM, vol. 20, no. 4, 1977.