Abstract
An adaptive caching algorithm, known as Adaptive Caching with Multiple Experts (ACME), has recently been presented in the field of web-caching. We explore the migration of ACME to the database caching environment. By integrating recently proposed database replacement policies into ACME’s existing policy pool, an attempt is made to gauge ACME’s ability to utilise newer methods of database caching. The results suggest that ACME is indeed well-suited to the database environment and performs as well as the best currently caching policy within its policy pool at any particular moment in its request stream. Although execution time increases by integrating more policies into ACME, the overall processing time improves drastically with erratic patterns of access, when compared to static policies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ari, I. (2002). Storage Embedded Networks (SEN) and Adaptive Caching using Multiple Experts (ACME), Ph.D. Proposal.
Ari, I., Amer, A., Miller, E., Brandt, S., and Long, D. (2002). Who is more adaptive? ACME: Adaptive Caching using Multiple Experts. Workshop on Distributed Data and Structures (WDAS 2002).
Castro, M., Adya, A., Liskov, B., and Myers, A. C. (1997). HAC: Hybrid Adaptive Caching for Distributed Storage Systems. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP), 102–115.
Effelsberg, W. and Haerder, T. (1984). Principles of Database Buffer Management. In ACM Transactions on Database Systems, 9(4), 560–595.
Jeon, H. S. and Noh, S. H. (1998). A Database Disk Buffer Management Algorithm Based on Prefetching. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM’ 98), 167–174.
Jiang, S. and Zhang, X. (2002). LIRS: An Efficient Low Inter-Reference Recency Set Replacement Policy to Improve Buffer Cache Performance. In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 31–42.
Johnson, T. and Shasha, D. (1994). 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In Proceedings of the 20th International Conference on Very Large Databases, 439–450.
Lee, D., Choi, J., Kim, J. H., Noh, S. H., Min, S. L., Cho, Y. and Kim, C. S. (1999). 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’99 International Conference on Measurement and Modeling of Computer Systems, 134–143.
O’Neil, E. J., O’Neil, P. E., and Weikum, G. (1993). The LRU-K Page Replacement Algorithm for Database Disk Buffering. In Proceedings of ACM MOD International Conference on Management of Data, 297–306.
Ramakrishnan, R. and Gehrke, J. (2000). Database Management Systems, McGraw Hill, USA.
Riaz-ud-din, F. (2003). Adapting ACME to the Database Caching Environment. Masters Thesis, Massey University.
Sacco, G. M. and Schkolnick, M. (1986). Buffer Management in Relational Database Systems. In ACM Transactions on Database Systems, 11, 473–498.
Turner, R. and Levy, H. (1981). Segmented FIFO Page Replacement. In Proceedings of ACM SIGMETRICS, 48–51.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Riaz-ud-Din, F., Kirchberg, M. (2006). Acme-DB: An Adaptive Caching Mechanism Using Multiple Experts for Database Buffers. In: Seruca, I., Cordeiro, J., Hammoudi, S., Filipe, J. (eds) Enterprise Information Systems VI. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3675-2_9
Download citation
DOI: https://doi.org/10.1007/1-4020-3675-2_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3674-3
Online ISBN: 978-1-4020-3675-0
eBook Packages: Computer ScienceComputer Science (R0)