Encyclopedia of Database Systems

Living Edition
| Editors: Ling Liu, M. Tamer Özsu

Optimistic Replication and Resolution

  • Marc ShapiroEmail author
Living reference work entry

Later version available View entry history

DOI: https://doi.org/10.1007/978-1-4899-7993-3_258-3


Asynchronous Replication; Lazy replication; Optimistic replication; Reconciliation-based data replication

The term “optimistic replication” is prevalent in the distributed systems and distributed algorithms literature. The database literature prefers “lazy replication.”


Data replication places physical copies of a shared logical item onto different sites. Optimistic replication (OR) [17] allows a program at some site to read or update the local replica at any time. An update is tentative because it may conflict with a remote update. Such conflicts are resolved after the fact, in the background. Replicas may diverge occasionally but are expected to converge eventually (see “Eventual Consistency”).

OR avoids the need for distributed coordination prior to using an item. It allows a site to execute even when remote sites have crashed, when network connectivity is poor or expensive, or while disconnected from the network.

The defining characteristic of OR is that any...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Bailis P, Fekete A, Franklin MJ, Ghodsi A, Hellerstein JM, Stoica I. Feral concurrency control: an empirical investigation of modern application integrity. In: SIGMOD, Melbourne. ACM; 2015. p. 1327–42. http://doi.acm.org/10.1145/2723372.2737784
  2. 2.
    Breitbart Y, Komondoor R, Rastogi R, Seshadril S. Update propagation protocols for replicated databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Philadelphia; 1999. p. 97–108.Google Scholar
  3. 3.
    Burckhardt S, Leijen D. Semantics of concurrent revisions. In: ESOP. LNCS. Saarbrücken; 2011. Vol. 6602. p. 116–135. http://dx.doi.org/10.1007/978-3-642-19718-5_7
  4. 4.
    Cederqvist P, et al. Version Management with CVS. Bristol: Network Theory; 2006.Google Scholar
  5. 5.
    Golding RA. Weak-consistency group communication and membership. PhD thesis, University of California, Santa Cruz. 1992. Technical Report no. UCSC-CRL-92-52. Available at: ftp://ftp.cse.ucsc.edu/pub/tr/ucsc-crl-92-52.ps.Z
  6. 6.
    Gotsman A, Yang H, Ferreira C, Najafzadeh M, Shapiro M. Cause I’m strong enough: reasoning about consistency choices in distributed systems. In: POPL, St. Petersburg. 2016. p. 371–84. http://dx.doi.org/10.1145/2837614.2837625
  7. 7.
    Gray J, Helland P, O’Neil P, Shasha D. The dangers of replication and a solution. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Montreal; 1996. p. 173–82.Google Scholar
  8. 8.
    Haifeng Yu, Amin V. Combining generality and practicality in a conit-based continuous consistency model for wide-area replication. In: Proceedings of 21st International Conference on Distributed Computing Systems, Arizona; 2001.Google Scholar
  9. 9.
    Kistler JJ, Satyanarayanan M. Disconnected operation in the Coda file system. ACM Trans Comp Syst. 1992;10(5):3–25.CrossRefGoogle Scholar
  10. 10.
    Lamport L. Time, clocks, and the ordering of events in a distributed system. Commun ACM. 1978;21(7):558–65.CrossRefzbMATHGoogle Scholar
  11. 11.
    Lloyd W, Freedman MJ, Kaminsky M, Andersen DG. Don’t settle for eventual: scalable causal consistency for wide-area storage with COPS. In: SOSP, Cascais. ACM; 2011. p. 401–16. http://doi.acm.org/10.1145/2043556.2043593
  12. 12.
    Oster G, Urso P, Molli P, Imine A. Proving correctness of transformation functions in collaborative editing systems. Rapport de recherche RR-5795, LORIA – INRIA Lorraine. 2005. Available at: http://hal.inria.fr/inria-00071213/
  13. 13.
    Petersen K Spreitzer MJ, Terry DB, Theimer MM, Demers AJ. Flexible update propagation for weakly consistent replication. In: Proceedings of 16th ACM Symposium on Operating System Principles, St. Malo; 1997. p. 288–301.Google Scholar
  14. 14.
    Preguiça N, Shapiro M, Matheson C. Semantics-based reconciliation for collaborative and mobile environments. In: Proceedings of International Conference on Cooperative Information Systems, Catania; 2003. p. 38–55.Google Scholar
  15. 15.
    Preguiça N, Marquès JM, Shapiro M, Leţia M. A commutative replicated data type for cooperative editing. In: ICDCS, Montréal; 2009. p. 395–403. http://doi.ieeecomputersociety.org/10.1109/ICDCS.2009.20
  16. 16.
    Roh H-G, Jeon M, Kim J-S, Lee J. Replicated abstract data types: building blocks for collaborative applications. JPDC. 2011;71(3):354–68. http://dx.doi.org/10.1016/j.jpdc.2010.12.006
  17. 17.
    Saito Y, Shapiro M. Optimistic replication. ACM Comput Surv. 2005;37(1):42–81.CrossRefzbMATHGoogle Scholar
  18. 18.
    Shapiro M, Preguiça N, Baquero C, Zawirski M. Conflict-free replicated data types. International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Volume 6976 of Lecture Notes in Computer Science, Grenoble; 2011. Springer. p 386–400.Google Scholar
  19. 19.
    Sovran Y, Power R, Aguilera MK, Li J. Transactional storage for geo-replicated systems. In: SOSP, Cascais. ACM; 2011. p. 385–400. http://doi.acm.org/10.1145/2043556.2043592
  20. 20.
    Sun C, Ellis C. Operational transformation in real-time group editors: issues, algorithms, and achievements. In: Proceedings of International Conference on Computer-Supported Cooperative Work, Seattle; 1998. p. 59.Google Scholar
  21. 21.
    Terry DB, Demers AJ, Petersen K, Spreitzer MJ, Theimer MM, Welch BB. Session guarantees for weakly consistent replicated data. In: Proceedings of International Conference on Parallel and Distributed Information Systems, Austin; 1994. p. 140–9.Google Scholar
  22. 22.
    Terry DB, Theimer MM, Petersen K, Demers AJ, Spreitzer MJ, Hauser CH. Managing update conficts in Bayou, a weakly connected replicated storage system. In: Proceedings of 15th ACM Symposium on Operating System Principles, Copper Mountain; 1995. p. 172–82.Google Scholar
  23. 23.
    Wuu GTJ, Bernstein AJ. Efficient solutions to the replicated log and dictionary problems. In: Proceedings of ACM SIGACT-SIGOPS 3rd Symposium on the Principles of Distributed Computing, Vancouver; 1984. p. 233–42.Google Scholar

Copyright information

© Springer Science+Business Media LLC 2017

Authors and Affiliations

  1. 1.UPRC-LiP6 and INRIA ParisParisFrance

Section editors and affiliations

  • Bettina Kemme
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontrealCanada