Replica Consistency in Lazy Master Replicated Databases
Distributed and Parallel Databases
Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Update Propagation Strategies for Improving the Quality of Data on the Web
Proceedings of the 27th International Conference on Very Large Data Bases
Update propagation strategies to improve freshness in lazy master replicated databases
The VLDB Journal — The International Journal on Very Large Data Bases
View Divergence Control of Replicated Data Using Update Delay Estimation
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
On demand synchronization and load distribution for database grid-based web applications
Data & Knowledge Engineering
Design and evaluation of a continuous consistency model for replicated services
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
| Hi-index | 0.00 |
Many distributed database applications need to replicate data to improve data availability and query response time. The two-phase-commit protocol guarantees mutual consistency of replicated data but does not provide good performance. Lazy replication has been used as an alternative solution in several types of applications such as on-line financial transactions and telecommunication systems. In this case, mutual consistency is relaxed and the concept of freshness is used to measure the deviation between replica copies. We propose two update propagation strategies that improve freshness. Both of them use immediate propagation: updates to a primary copy are propagated towards a slave node as soon as they are detected at the master node without waiting for the commitment of the update transaction. We study the behavior of our strategies and show that they improve data freshness with respect to the deferred approach.