Skip to main content
SpringerLink
Log in

An evaluation of buffer management strategies for relational database systems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we present a new algorithm, DBMIN, for managing the buffer pool of a relational database management system. DBMIN is based on a new model of relational query behavior, thequery locality set model (QLSM). Like the hot set model, the QLSM has an advantage over the stochastic models due to its ability to predict future reference behavior. However, the QLSM avoids the potential problems of the hot set model by separating the modeling of reference behavior from any particular buffer management algorithm. After introducing the QLSM and describing the DBMIN algorithm, we present a performance evaluation methodology for evaluating buffer management algorithms in a multiuser environment. This methodology employed a hybrid model that combines features of both trace-driven and distribution-driven simulation models. Using this model, the performance of the DBMIN algorithm in a multiuser environment is compared with that of the hot set algorithm and four more traditional buffer replacement algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. M. Astrahanet. al., System R: a relational approach to database management,ACM Trans. Database Systems,1 (1976).

  2. D. Bitton, D. J. DeWitt, and C. Turbyfill, Benchmarking database systems: a systematic approach,Proceedings of the Ninth International Conference on Very Large Data Bases, 1983.

  3. M. W. Blasgen, and K. P. Eswaran, Storage and access in relational data base,IBM Systems J. 4 (1977), 363–377.

    Article  Google Scholar 

  4. H. Boral and D. J. DeWitt, A methodology for database system performance evaluation,Proceedings of the International Conference on Management of Data, Boston, MA, 1984, pp. 176–185.

  5. Hong-Tai Chou, D. J. DeWitt, R. H. Katz, and A. C. Klug, Design and implementation of the Wisconsin storage system, Computer Sciences Technical Report 524, Department of Computer Sciences, University of Wisconsin, Madison, 1983.

    Google Scholar 

  6. Hong-Tai Chou, Buffer management in database systems, Ph.D. Thesis, University of Wisconsin, Madison, 1985.

    Google Scholar 

  7. D. J. DeWitt, R. Finkel, and M. Solomon, The CRYSTAL multicomputer: design and implementation experience, Computer Sciences Technical Report 553, Department of Computer Sciences, University of Wisconsin, Madison, 1984.

    Google Scholar 

  8. P. J. Denning, The working set model for program behavior,Comm. ACM,11 (1968), 323–333.

    Article  Google Scholar 

  9. P. J. Denning, K. C. Kahn, J. Leroudier, D. Potier, and R. Suri, Optimal multiprogramming,Acta Inform.,7 (1976), 197–216.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. J. Denning, Optimal multiprogrammed memory management, inCurrent Trends in Programming Methodology, vol. III (R. T. Yeh, ed.), Prentice-Hall, Englewood Cliffs, NJ, 1978, pp. 298–322.

    Google Scholar 

  11. W. Effelsberg and T. Haerder, Principles of database buffer management,ACM Trans. Database Systems,9 (1984), 560–595.

    Article  Google Scholar 

  12. E. B. Fernandez, T. Lang, and C. Wood, Effect of replacement algorithms on a paged buffer database system,IBM J. Res. Develop. 22 (1978), 185–196.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. H. Fogel, The VMOS paging algorithm, a practical implementation of the working set model,ACM Operating System Rev. 8 (1974).

  14. Fujitsu Limited,M2351A/AF Mini-Disk Drive CE Manual, 1982.

  15. E. Gelenbe, A unified approach to the evaluation of a class of replacement algorithms,IEEE Trans. Comput. 22 (1973), 611–618.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. A. Kaplan, Buffer management policies in a database environment, Master Report, University of California, Berkeley, 1980.

    Google Scholar 

  17. W. F. King, III, Analysis of demand paging algorithms,Proceedings of the IFIP Congress (Information Processing 71), North Holland, Amsterdam, 1971, pp. 485–490.

  18. T.' Lang, C. Wood, and I. B. Fernandez, Database buffer paging in virtual storage systems,ACM Trans. Database Systems, 2 (1977).

  19. J. Leroudier and D. Potier, Principles of optimality for multi-programming,Proceedings of the International Symposium on Computer Performance Modeling, Measurement, and Evaluation, ACM SIGMETRICS (IFIP WG. 7.3), Cambridge, 1976, pp. 211–218.

  20. C. Nyberg, Disk scheduling and cache replacement for a database machine, Master Report, University of California, Berkeley, 1984.

    Google Scholar 

  21. H. Opderbeck and W. W. Chu, Performance of the page fault frequency replacement algorithm in a multiprogramming environment,Proceedings of the IFIP Congress (Information Processing 74), North Holland, Amsterdam, 1974, pp. 235–241.

  22. A. Reiter, A study of buffer management policies for data management systems, Technical Summary Report 1619, Mathematics Research Center, University of Wisconsin, Madison, 1976.

    Google Scholar 

  23. G. M. Sacco and M. Schkolnick, A mechanism for managing the buffer pool in a relational database system using the hot set model,Proceedings of the Eighth International Conference on Very Large Data Bases, Mexico City, 1982, pp. 257–262.

  24. G. M. Sacco and M. Schkolnick, Buffer management in relational database systems,ACM Trans. Database Systems (to appear).

  25. R. G. Sargent, Statistical analysis of simulation output data,Proceedings of the ACM Symposium on Simulation of Computer Systems, 1976.

  26. S.W. Sherman and J. C. Browne, Trace driven modeling: review and overview,Proceedings of the ACM Symposium on Simulation of Computer Systems, 1973, pp. 201–207.

  27. S. W. Sherman and R. S. Brice, I/O buffer performance in a virtual memory system,Proceedings of the ACM Symposium on Simulation of Computer Systems, 1976, pp. 25–35.

  28. S. W. Sherman and R. S. Brice, Performance of a database manager in a virtual memory system,ACM Trans. Database Systems, 1 (1976).

  29. M. Stonebraker, M. E. Wong, and P. Kreps, The design and implementation of INGRES,ACM Trans. Database Systems,1 (1976), 189–222.

    Article  Google Scholar 

  30. M. Stonebraker, Operating system support for database management,Comm. ACM,24 (1981), 412–418.

    Article  Google Scholar 

  31. M. Stonebraker, J. Woodfill, J. Ranstrom, M. Murphy, M. Meyer, and E. Allman, Performance enhancements to a relational database system,TODS, 8 (1983).

  32. J. M. Thorington, Jr. and D. J. Irwin, An adaptive replacement algorithm for paged memory computer systems,IEEE Trans. Comput. 21 (1972), 1053–1061.

    Article  Google Scholar 

  33. W. G. Tuel, Jr., An analysis of buffer paging in virtual storage systems,IBM J. Res. Develop. 20 (1976), 518–520.

    MATH  Google Scholar 

  34. S. B. Yao, Approximating block accesses in database organizations,Comm. ACM,20, (1977), 260–261.

    Article  MATH  Google Scholar 

Download references

Author information

Author notes

  1. Hong -Tai Chou

    Present address: Microelectronics and Computer Technology Corporation, Austin, Texas, USA

Authors and Affiliations

  1. Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, USA

    Hong -Tai Chou & David J. DeWitt

Authors
  1. Hong -Tai Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David J. DeWitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Dale Skeen.

This research was partially supported by the Department of Energy under Contract No. DE-AC02-81ER10920 and the National Science Foundation under grant MCS82-01870.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chou, H.T., DeWitt, D.J. An evaluation of buffer management strategies for relational database systems. Algorithmica 1, 311–336 (1986). https://doi.org/10.1007/BF01840450

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01840450

Key words

Search

Navigation