HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases

Abstract : In a lazy master replicated database, a transaction can commit after updating one replica copy (primary copy) at some master node. After the transaction commits, the updates are propagated towards the other replicas (secondary copies), which are updated in separate refresh transactions. A central problem is the design of algorithms that maintain replica's consistency while at the same time minimizing the performance degradation due to the synchronization of refresh transactions. In this paper, we propose a simple and general refreshment algorithm that solves this problem and we prove its correctness. The principle of the algorithm is to let refresh transactions wait for a certain «deliver time» before being executed at a node having secondary copies. We then present two main optimizations to this algorithm. One is based on specific properties of the topology of replica distribution across nodes. In particular, we characterize the nodes for which the deliver time can be null. The other improves the refreshment algorithm by using an immediate update propagation strategy. Our performance evaluation demonstrate the effectiveness of this optimization.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 5:19:36 PM
Last modification on : Friday, February 4, 2022 - 3:08:40 AM
Long-term archiving on: : Monday, April 5, 2010 - 9:44:52 PM


  • HAL Id : inria-00077204, version 1



Esther Pacitti, Pascale Minet, Eric Simon. Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases. [Research Report] RR-3654, INRIA. 1999. ⟨inria-00077204⟩



Record views


Files downloads