Implementing global memory management in a workstation cluster
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Implementing cooperative prefetching and caching in a globally-managed memory system
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Optimizing a 'Content-Aware' Load Balancing Strategy for Shared Web Hosting Service
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
Autonomic Data Placement Strategies for Update-intensiveWeb applications
AAA-IDEA '05 Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications
Lazy database replication with snapshot isolation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Implementation of a reliable remote memory pager
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Tashkent+: memory-aware load balancing and update filtering in replicated databases
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
A survey on dynamic Web content generation and delivery techniques
Journal of Network and Computer Applications
Dynamic load balancing for I/O-intensive applications on clusters
ACM Transactions on Storage (TOS)
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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.