Buffer management in distributed database systems: A data mining-based approach

  • L. Feng
  • H. Lu
  • Y. C. Tay
  • K. H. Tung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1377)


In this paper, we propose a data mining-based approach to public buffer management in distributed database systems where database buffers are organized into two areas: public and private. While the private buffer areas contain pages to be updated by particular users, the public buffer area contains pages shared among users from different sites. Different from traditional buffer management strategies where limited knowledge of user access patterns is used, the proposed approach discovers knowledge from page access sequences of user transactions and uses it to guide public buffer placement and replacement. The knowledge to be discovered and the discovery algorithms are discussed. The effectiveness of the proposed approach was investigated through a simulation study. The results indicate that with the help of the discovered knowledge, the public buffer hit ratio can be improved significantly.


Large Data Base Buffer Management Access Probability Buffer Frame Page Access 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD Int'l Conf. on management of data, pages 207–216, Washington D.C., USA, May 1993.Google Scholar
  2. 2.
    R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Conf. on Very Large Data Bases, pages 478–499, Santiago, Chile, September 1994.Google Scholar
  3. 3.
    ö. Babaoglu and D. Ferrari. Two-level replacement decisions in paging stores. IEEE Transactions on Computers, 32(12):1151–1159, December 1983.Google Scholar
  4. 4.
    M.J. Carey, R. Jauhari, and M. Livny. Priority in DBMS resource scheduling. In Proc. of the 15th Conf. on Very Large Data Bases, pages 397–410, Amsterdam, August 1989.Google Scholar
  5. 5.
    C.Y. Chan, B.C Ooi, and H. Lu. Extensible buffer management of indexes. In Proc. of the 18th Conf. on Very Large Data Bases, pages 444–454, British Columbia, Canada, August 1992.Google Scholar
  6. 6.
    M.S. Chen, P.S. Yu, and T.H. Yang. On coupling multiple systems with a global buffer. IEEE Transactions on Knowledge and Data Engineering, 8(2):339–344, April 1996.CrossRefGoogle Scholar
  7. 7.
    H. Chou and D. DeWitt. An evaluation of buffer management strategies for relational database systems. In Proc. of the 11th Conf. on Very Large Data Bases, pages 127–141, Stickhilm, Sweden, August 1985.Google Scholar
  8. 8.
    A. Dan, D.M. Dias, and P.S. Yu. Analytical modelling of a hierarchical buffer for a data sharing environment. In Proc. of the ACM SIGMETRICS, pages 156–167, San Diego, CA, May 1991.Google Scholar
  9. 9.
    W. Effelsberg and T. Haerder. Principles of database buffer management. ACM Transaction on Database Systems, 9(4):560–595, December 1984.CrossRefGoogle Scholar
  10. 10.
    R. Jauhari, M.J. Carey, and M. Livny. Priority-hints: an algorithm for priority-based buffer management. In Proc. of the 16th Conf. on Very Large Data Bases, pages 708–721, Brisbane, Australia, August 1990.Google Scholar
  11. 11.
    T. Johnson and D. Shasha. 2Q: A low overhead high performance buffer management replacement algorithm. In Proc. of the 20th Conf. on Very Large Data Bases, pages 439–450, Santiago, Chile, September 1994.Google Scholar
  12. 12.
    J.P. Kearns and S. DeFazio. Diversity in database reference behavior. Performance Evaluation Review, 17(1):11–19, May 1989.Google Scholar
  13. 13.
    D.E. Knuth. The Art of Computer Programming, Vol.3: Sorting and Searching. Addison-Wesley, 1973.Google Scholar
  14. 14.
    V.F. Nicola, A. Dan, and D.M. Dias. Analysis of the generalized clock buffer replacement scheme for database transaction processing. ACM SIGMETRICS and PERFORMANCE, 20(1):35–46, June 1992.Google Scholar
  15. 15.
    E.J. O'Neil, P.E. O'Neil, and G. Weikum. The LRU-K page replacement algorithm for database disk buffering. In Proc. of the 1993 ACM SIGMOD Int'l Conf. on management of data, pages 297–306, Washington D.C., USA, August 1993.Google Scholar
  16. 16.
    J.T. Robinson and M.V. Devarakonda. Data cache management using frequency-based replacement. In Proc. of the 1990 ACM SIGMOD Int'l Conf. on management of data, pages 134–142, Brisbane, August, August 1990.Google Scholar
  17. 17.
    G.M. Sacco and M. Schkolnick. A mechanism for managing the buffer pool in a relational database system using the hot set model. In Proc. of the 8th Conf. on Very Large Data Bases, pages 257–262, Mexcio City, September 1982.Google Scholar
  18. 18.
    G.M. Sacco and M. Schkolnick. Buffer management in relational database systems. ACM Transactions on Database Systems, 11(4):473–498, December 1986.CrossRefGoogle Scholar
  19. 19.
    G. Weikum, C. Hasse, A. Mönkeberg, and P. Zabback. The comfort automatic tuning project. Information Systems, 19(5):381–432, May 1994.CrossRefGoogle Scholar
  20. 20.
    P.S. Yu, D.M. Dias, J.T. Robinson, B.R. Iyer, and D.W. Cornell. On coupling multi-systems through data sharing. Proc. of the IEEE, 75(5):573–587, May 1987.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • L. Feng
    • 1
  • H. Lu
    • 2
  • Y. C. Tay
    • 2
  • K. H. Tung
    • 2
  1. 1.The Hong Kong Polytechnic UniversityKowloonHong Kong
  2. 2.National University of SingaporeSingapore

Personalised recommendations