Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2003.10D.4.647

The Consistency Management Using Trees of Replicated Data Items in Partially Replicated Database  

Bae, Mi-Sook (전남대학교 대학원 전산학과)
Hwang, Bu-Hyun (전남대학교 전산학과)
Publication Information
The KIPS Transactions:PartD / v.10D, no.4, 2003 , pp. 647-654 More about this Journal
Abstract
The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.
Keywords
Partially Replicated Databases; Hierarchy of Data; Timestamp; Replication Consistency;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. Makpangou, G. Pwwierre, C. Khoury and N. Dorta, Replicated Directory Service for Weakly Consistent Distributed Caches, IEEE, pp.92-100, 1999   DOI
2 P. Chundi, D. Rosenkrantz and S. Ravi, 'Deferred Updates and Data Placement in Distributed Databases,' 12th International Conference on Data Engineering, IEEE, 1996   DOI
3 Y. Saito and H. Levy, 'Optimistic Replication for Internet Data Services,' 14th International Conference on DISC, Toledo, Spain, pp.297-314, 2000
4 R. Jimenez-Peris, M. Patino-Martinez, G. Alonso and S. Arevalo, 'Reducing The Latency of Non-Blocking Commitment Using Optimism and Replication', IEEE Int. Conf. on Dependable Systems and Networks(DSN), Goteborg, Sweden, July, 2001
5 T. Andrson, Y. Breitbart, H. F. Korth and A. Wool, 'Replication, consistency and practicality : Are these mutually exclusive?,' InProcs. of the ACM SIGMOD International Conf. on Management of Data, Seattle, WA, pp.484-495, 1998   DOI
6 Y. Breitbart and H. Korth, 'Replication and consistency: Being lazy helps sometimes,' in Procs. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases Systems, Tucson, Arizona, pp.173-184, 1997   DOI
7 Y. Breitbart, R. Komondoor, R. Rastogi, S. Seshadri and A. Silberschatz, 'Update Propagation Protocols for Replicated Databases,' In Procs. of ACM SIGMOD International Conf. on Management of Data, Philadelphia, pp.97-108, 1999   DOI
8 J.G ary, P. Helland, P. O'Neil and D. Shasha, 'The Danger of Replication and a Solution', In Procs. of ACM SIGMOD International Conf. on Management of Data, Montreal, Canada, pp.173-182, 1996   DOI
9 E. Pacitti and E. Simon, 'Update Propagation Strategies to Improve Freshness in Lazy Master Replicated Databases,' VLDB Journal, pp. 305-318, 2000   DOI
10 E. Pacitti, P. Minet and E. Simon, 'Fast Algorithms for Maintaining Replica Consistency in Lazy Mater Replica Databases,' Proceedings of The 25th VLDB conference, Edinburgh, Scotland, pp.126-137, 1999
11 X. Liu, B. Heal and E. Du, 'Multiview Access Protocols for Large Scale Replication,' ACM Transaction on Database Systems, pp.158-198, June, 1998   DOI   ScienceOn
12 Coulouris, Dollimore, Kindberg, 'Distributed Systems: Concepts and Design,' Edition 3, Addison-Wesley, 2001
13 T. Johnson and K. Jeong, 'Hierarchical Matrix Timestamps for Scalable Update Propagation,' 10th International Workshop on Distributed Algorithm, June, 1996