Conflict-free Replicated Data Types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

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.
Fichier principal
Vignette du fichier
RR-7687.pdf (262.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00609399 , version 1 (19-07-2011)
inria-00609399 , version 2 (27-08-2011)

Identifiers

  • HAL Id : inria-00609399 , version 1

Cite

Marc Shapiro, Nuno Preguiça, Carlos Baquero, Marek Zawirski. Conflict-free Replicated Data Types. [Research Report] RR-7687, 2011, pp.18. ⟨inria-00609399v1⟩
2659 View
68808 Download

Share

Gmail Facebook X LinkedIn More