DPR: A Dynamic Partial Replication Protocol Based on Group Communication for a Web-Enable Database Cluster
This paper proposes a dynamic partial replication protocol based upon group communication system for use with a web-enable database cluster. It dynamically combines the advantages of both a partial and a full replication model according to a query pattern. Most eager-update replication protocols that have been suggested as the best replication for a database cluster are based on the full replication. However, an actual database cluster system needs partial replication rather than full replication to achieve high throughputs and scalability. The proposed Dynamic partial Replication (DPR) protocol guarantees consistency among replicas and reduces the overhead due to remote access inherent in the previous partial replication protocols. The proposed protocol consists of three parts: partial replica control, scale-out factor estimation and dynamic replica allocation. Partial replica control part is the framework for the DPR protocol. Scale-out factor estimation part determines the optimal number of replicas according to the current query pattern and access frequency to maximize throughput and efficiency. Dynamic replica allocation part creates or removes the temporary replica in a local site. The simulated evaluation shows that the proposed protocol outperforms the existing eager-update protocols, achieving improvements of approximately 16% in response time and 20% in scalability.
KeywordsData Item Partial Replication Remote Access Query Pattern Access Frequency
Unable to display preview. Download preview PDF.
- 1.R. Buyya: High Performance Cluster Computing. Prentice Hall PTR, Vol. 1 (1999)Google Scholar
- 3.U. Fritzke, P. Ingels: Transactions on partially replicated data based on reliable and atomic multicasts. The 21st International Conference on Distributed Computing Systems (ICDCS), Mesa, AZ. (2001) 284–291Google Scholar
- 4.J. Gray, P. Helland, P. E. O’Neil, D Shasha: The dangers of replication and a solution. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, (1996) 284–291Google Scholar
- 5.J. Holliday, D. Agrawal, A. El Abbadi: Partial database replication using epidemic communication. In Proc. of the Int. Conf. on Distributed Computing Systems (2002)Google Scholar
- 6.J. Holliday, R. Steinke, D. Agrawal, A. El Abbadi: Epidemic quorums for managing replicated data. In Proc. of the IEEE Int. Performance, Computing and Communications Conf. (IPCCC), Phoenix Arizona (2000) 93–100Google Scholar
- 7.R. Jimenez-Peris, M. Patino-Martinez, B. Kemme, G. Alonso: Improving the scalability of fault-tolerant database clusters. The 22nd International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, July (2002)Google Scholar
- 8.B. Kemme, G. Alonso: Don’t be lazy, be consistent: Postgres-R, a new way to implement database replication. In Proc. of the Int. Conf. on Very Large Data Bases (VLDB), Cairo Egypt September (2000)Google Scholar
- 9.B. Kemme, G. Alonso: A new approach to developing and implementing eager database replication protocols. ACM Transactions on Database Systems, September (2000)Google Scholar
- 10.B. Kemme: Database Replication for Clusters of Workstations. PhD thesis, Department of Computer Science, ETH Zurich Switzerland (2000)Google Scholar
- 11.Philip Russom: Get answers to your questions about a relatively new form of clustering the database cluster. Intelligent Enterprise Magazine December 12 (2001)Google Scholar
- 13.M. Wiesmann: Group Communication and Database Replication: Techniques, Issues and Performance, PhD thesis, ETH Zurich Switzerland (2002)Google Scholar