Skip to Main content Skip to Navigation
New interface
Conference papers

Comparing Optimistic Database Replication Techniques

Pierre Sutra 1 Marc Shapiro 1 
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : 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.
keyword : rep db
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Marc Shapiro Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2010 - 4:08:41 PM
Last modification on : Friday, January 21, 2022 - 3:21:28 AM
Long-term archiving on: : Friday, June 18, 2010 - 12:30:14 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads