Skip to main content
Log in

Managing Multiuser Database Buffers Using Data Mining Techniques

  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

In this paper, we propose a data-mining-based approach to public buffer management for a multiuser database system, 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 different users. Unlike 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. A prefetch strategy is exploited based on the discovered page access knowledge. In practice, to make such a data-mining-based buffer management approach tractable, we present a soft variation to approximate our absolute best buffer replacement solution. The knowledge to be discovered and the discovery methods are discussed in the paper. 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, while the added computational complexity, compared to the achievement in buffer hit ratio, is less. In some situations, the time cost of the data-mining-based buffer management policy is even lower than that of the simplest buffer management policy.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD international conference on management of data, Washington, DC, May 1993, pp 207–216

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th conference on very large data bases, Santiago, Chile, September 1994, pp 478–499

  3. Babaoglu Ö, Ferrari D (1983) Two-level replacement decisions in paging stores. IEEE Trans Comput 32(12):1151–1159

    Google Scholar 

  4. Brown KP, Carey MJ, Livny M (1996) Goal-oriented buffer management revisited. In: Proceedings of the 1996 ACM SIGMOD international conference on management of data, Montreal, June 1996, pp 353–364

  5. Carey MJ, Jauhari R, Livny M (1989) Priority in DBMS resource scheduling. In: Proceedings of the 15th conference on very large data bases, Amsterdam, August 1989, pp 397–410

  6. Chan CY, Ooi BC, Lu H (1992) Extensible buffer management of indexes. In: Proceedings of the 18th conference on very large data bases, Vancouver, British Columbia, Canada, August 1992, pp 444–454

  7. Chen CM, Roussopoulos N (1993) Adaptive database buffer allocation using query feedback. In: Proceedings of the 19th conference on very large data bases, Dublin, Ireland, August 1993, pp 342–353

  8. Chen MS, Yu PS, Yang TH (1996) On coupling multiple systems with a global buffer. IEEE Trans Knowl Data Eng 8(2):339–344

    Article  Google Scholar 

  9. Chou H, DeWitt D (1985) An evaluation of buffer management strategies for relational database systems. In: Proceedings of the 11th conference on very large data bases, Stockholm, Sweden, August 1985, pp 127–141

  10. Chung J, Ferguson D, Wang G, Nikolaou C, Teng J (1994) Goal oriented dynamic buffer pool management for database systems. Technical Report, IBM Research Report RC19807

  11. Copeland G, Alexander W, Boughter E, Keller T (1988) Data placement in bubba. In: Proceedings of the ACM SIGMOD international conference on management of data, Chicago, June 1988, pp 99–108

  12. Dan A, Dias DM, Yu PS (1991) Analytical modelling of a hierarchical buffer for a data sharing environment. In: Proceedings of the ACM SIGMETRICS, San Diego, May 1991, pp 156–167

  13. Denning PJ (1968) The working set model for program behavior. Commun ACM 11(5):323–333

    Article  Google Scholar 

  14. Effelsberg W, Haerder T (1984) Principles of database buffer management. ACM Trans Database Sys 9(4):560–595

    Article  Google Scholar 

  15. Faloutsos C, Ng R, Sellis T (1991) Predictive load control for flexible buffer allocation. In: Proceedings of the 17th conference on very large data bases, Barcelona, September 1991, pp 265–274

  16. Faloutsos C, Ng R, Sellis T (1995) Flexible and adaptable buffer management techniques for database management systems. IEEE Trans Comput 44(4):546–560

    Article  MATH  Google Scholar 

  17. Feng L, Li Q, Leung HY (2002) Effective allocation of database buffers by mining users’ access histories. Appl Sys Stud 3(2)

  18. Jauhari R, Carey MJ, Livny M (1990) Priority-hints: an algorithm for priority-based buffer management. In: Proceedings of the 16th conference on very large data bases, Brisbane, Australia, August 1990, pp 708–721

  19. Johnson T, Shasha D (1994) 2Q: A low overhead high performance buffer management replacement algorithm. In: Proceedings of the 20th conference on very large data bases, Santiago, Chile, September 1994, pp 439–450

  20. Kearns JP, DeFazio S (1989) Diversity in database reference behavior. Perform Eval Rev 17(1):11–19

    Google Scholar 

  21. Knuth DE (1973) The art of computer programming, vol 3: Sorting and searching. Addison-Wesley, Reading, MA

  22. Nicola VF, Dan A, Dias DM (1992) Analysis of the generalized clock buffer replacement scheme for database transaction processing. ACM SIGMETRICS Perform 20(1):35–46

    Google Scholar 

  23. Ng R, Faloutsos C, Sellis T (1991) Flexible buffer allocation based on marginal gains. In: Proceedings of the 1991 ACM SIGMOD international conference on management of data, Denver, CO, May 1991, pp 387–396

  24. O’Neil EJ, O’Neil PE, Weikum G (1993) The LRU-K page replacement algorithm for database disk buffering. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, Washington, DC, August 1993, pp 297–306

  25. O’Neil EJ, O’Neil PE, Weikum G (1996) An optimal proof of the LRU-K page replacement algorithm. Technical report, University of Massachussetts/Boston and University of the Saarland

  26. Robinson JT, Devarakonda MV (1990) Data cache management using frequency-based replacement. In: Proceedings of the 1990 ACM SIGMOD international conference on management of data, Brisbane, Australia, August 1990, pp 134–142

  27. Sacco GM, Schkolnick M (1982) A mechanism for managing the buffer pool in a relational database system using the hot set model. In: Proceedings of the 8th conference on very large data bases, Mexcio City, September 1982, pp 257–262

  28. Sacco GM, Schkolnick M (1986) Buffer management in relational database systems. ACM Trans Database Sys 11(4):473–498

    Article  Google Scholar 

  29. Tung AKH, Tay YC, Lu H (1998) BROOM: Buffer replacement using online optimization by mining. In: Proceedings of the international conference on information and knowledge management, Bethesda, MD, November 1998, pp 185–192

  30. Weikum G, Hasse C, Mönkeberg A, Zabback P (1994) The comfort automatic tuning project. Inf Sys 19(5):381–432

    Article  Google Scholar 

  31. Yu PS, Dias DM, Robinson JT, Iyer BR, Cornell DW (1987) On coupling multi-systems through data sharing. Proc IEEE 75(5):573–587

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ling Feng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, L., Lu, H. Managing Multiuser Database Buffers Using Data Mining Techniques. Know. Inf. Sys. 6, 679–709 (2004). https://doi.org/10.1007/s10115-003-0114-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-003-0114-9

Keywords