The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (1998)
Amsterdam, The Netherlands
May 26, 1998 to May 29, 1998
ISSN: 1063-6927
ISBN: 0-8186-8292-2
pp: 164
Eric Simon , INRIA
Rubens Melo , PUC-Rio
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.
Replication, Update Propagation, Performance Analysis
Eric Simon, Rubens Melo, Esther Pacitti, "Improving Data Freshness in Lazy Master Schemes", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 164, 1998, doi:10.1109/ICDCS.1998.679499
80 ms
(Ver 3.3 (11022016))