Abstract
We propose a buffer cache de-duplication technique for query dispatch in replicated databases. In the field of replicated databases, there is the well-known problem called ’Buffer Cache Duplication’ problem, which means that different buffer caches share some identical data. Unfortunately, existing approaches of de-duplication have shortcomings; the only SQL statements of queries (e.g. FROM and WHERE clauses) are insufficient to estimate exactly which data the queries reference for duplication-free dispatch. Our approach uses index access patterns to construct a look-up table that allows dispatchers to determine which database it should dispatch a query. We implement a prototype and demonstrate that under a certain condition around 90% of the duplication holds down to 12% in two databases, and it cuts down the referenced data on each buffer cache to approximately 40% in eight databases. Finally, we will discuss whether the condition can be applied to actual workloads.
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
Ravi, J., et al.: A survey on dynamic Web content generation and delivery techniques. Journal of Network and Computer Applications 32(5), 943–960 (2009)
Daudjee, K., Salem, K.: Lazy Database Replication with Snapshot Isolation. In: Proceedings of 32nd International Conference on Very Large Data Bases (2006)
Mishima, T., et al.: Pangea: An Eager Database Replication Middleware guaranteeing Snapshot Isolation without Modification of Database Servers. In: Proceedings of 35nd International Conference on Very Large Data Bases (2009)
Krikellas, K., et al.: Strongly consistent replication for a bargain. In: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering (2010)
Pai, V.S., et al.: Locality-Aware Request Distribution in Cluster-based Network Servers. In: Proceedings of the 8th ACM Conference on Architectural Support for Programming Languages and Operating Systems (1998)
Elnikety, S., et al.: Tashkent+: Memory-Aware Load Balancing and Update Filtering in Replicated Database. SIGOPS Oper. Syst. Rev. 41(3), 399–412 (2007)
Transaction Processing Performance Council, http://www.tpc.org/
Sivasubramanian, S., et al.: Autonomic data placement strategies for update-intensive Web applications. In: Proceedings of the International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)
Garey, M.R., et al.: Resource constrained scheduling as generalized bin packing. J. Combinatrial Teory, Ser. A, 257–298 (1976)
David, R.: Karger.: Global min-cuts in RNC, and other ramifications of a simple min-out algorithm. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993)
Breslau, L., et al.: Web caching and zipf-like distributions: evidence and implications. In: Proceedings of IEEE Conference on Computer Communications (INFOCOM 1999), pp. 126–134 (1999)
Levy, H., et al.: Implementing Cooperative Prefetching and Caching in a Globally-Managed Memory System. In: Proceedings of the ACM SIGMETRICS 1998 Conference (1998)
Feeley, M.J., et al.: Implementing global memory management in a workstation cluster. In: Proceedings of the Fifteenth ACM symposium on Operating System Principles (1995)
Markatos, E.P., Dramitinos, G.: Implementation of a Reliable Remote Memory Pager. In: Proc. 1996 Usenix Technical Conf., pp. 177–190 (1996)
Cherkasova, L., Ponnekanti, S.R.: Optimizing a ’Content-Aware’ Load Balancing Strategy for Shared Web Hosting Service. In: Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication System (2000)
Qin, X., et al.: Dynamic load balancing for I/O-intensive applications on clusters. ACM Transactions on Storage (TOS)Â 5(4), No.9 (2009)
Elnikety, S., et al.: A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites. In: The Proceedings of the 13th International World Wide Web Conference, WWW 2004 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamuro, T., Suga, Y., Kotani, N., Hitaka, T., Yamamuro, M. (2011). Buffer Cache De-duplication for Query Dispatch in Replicated Databases. In: Yu, J.X., Kim, M.H., Unland, R. (eds) Database Systems for Advanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20152-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-20152-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20151-6
Online ISBN: 978-3-642-20152-3
eBook Packages: Computer ScienceComputer Science (R0)