Comparing Optimistic Database Replication Techniques - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Comparing Optimistic Database Replication Techniques

Pierre Sutra
Marc Shapiro


Replication is attractive for scaling databases up, as it does not require costly equipment and it enables fault tolerance. However, as the latency gap between local and remote accesses continues to widen, maintaining consistency between replicas remains a performance and complexity bottleneck. Optimistic replication (OR) addresses these problems. In OR, a database tentatively executes transactions against its local cache; databases reconcile a posteriori to agree on a common schedule of committed transactions. We present three OR protocols based on the deferred update scheme. The first two are representative of the state the art. The third is new; we describe it in detail. As all three protocols are expressed within a common formal framework, we are able to compare them, to identify similarities and differences, and to introduce common variants. We show that our protocol behaves better than the other two, with respect to latency, message cost and abort rate.


Fichier principal
Vignette du fichier
sutra-shapiro-bda2007.pdf (192.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00444785 , version 1 (07-01-2010)


  • HAL Id : inria-00444785 , version 1


Pierre Sutra, Marc Shapiro. Comparing Optimistic Database Replication Techniques. Bases de Données Avancées (BDA), Oct 2007, Marseille, France. ⟨inria-00444785⟩
210 View
155 Download


Gmail Facebook Twitter LinkedIn More