Conflict-free Replicated Data Types

Abstract : Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in large-scale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisfies these conditions is called a Conflict-free Replicated Data Type (CRDT). Replicas of any CRDT are guaranteed to converge in a self-stabilising manner, despite any number of failures. This paper formalises two popular approaches (state- and operation-based) and their relevant sufficient conditions. We study a number of useful CRDTs, such as sets with clean semantics, supporting both add and remove operations, and consider in depth the more complex Graph data type. CRDT types can be composed to develop large-scale distributed applications, and have interesting theoretical properties.
Document type :
[Research Report] RR-7687, INRIA. 2011, pp.18
Liste complète des métadonnées
Contributor : Marek Zawirski <>
Submitted on : Saturday, August 27, 2011 - 3:40:05 AM
Last modification on : Friday, September 16, 2016 - 3:06:09 PM
Document(s) archivé(s) le : Sunday, December 4, 2016 - 9:40:43 PM


Files produced by the author(s)


  • HAL Id : inria-00609399, version 2



Marc Shapiro, Nuno Preguiça, Carlos Baquero, Marek Zawirski. Conflict-free Replicated Data Types. [Research Report] RR-7687, INRIA. 2011, pp.18. <inria-00609399v2>



Record views


Document downloads