An update propagation method based on the tree of replicas in partially replicated databases

Authors:
Misook Bae;Buhyun Hwang
Affiliations:
Dept. of Computer Science, Chonnam National University, Kwangju, Republic of Korea;Dept. of Computer Science, Chonnam National University, Kwangju, Republic of Korea
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 6
Cited 1

The dangers of replication and a solution

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Replication and consistency: being lazy helps sometimes

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Replication, consistency, and practicality: are these mutually exclusive?

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multiview access protocols for large-scale replication

ACM Transactions on Database Systems (TODS)
Scalable Replication in Database Clusters

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Update propagation strategies to improve freshness in lazy master replicated databases

The VLDB Journal — The International Journal on Very Large Data Bases

A propagation strategy implemented in communicative environment

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the single master lazy updates propagation methods that guarantee weakly consistency, they may increase the read availability, but have more chances for update conflicts. We propose an effective update propagation method to resolve this non-serializable execution. The proposed method is based on the balanced tree of replicas in the partially replicated databases and uses the timestamp and the information of the RCTL(the most Recent Committed update-Transaction List) in the status database. We made an experiment of our algorithm through the simulation, and proved that it has good performance due to reducing the abort ratio and response time of transactions.