Cure: Strong semantics meets high availability and low latency - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Cure: Strong semantics meets high availability and low latency


Developers of cloud-scale applications face a difficult decision of which kind of storage to use, summarised by the CAP theorem. Currently the choice is between classical CP databases, which provide strong guarantees but are slow, expensive, and unavailable under partition; and NoSQL-style AP databases, which are fast and available, but too hard to program against. We present an alternative: Cure provides the highest level of guarantees that remains compatible with availability. These guarantees include: causal consistency (no ordering anomalies), atomicity (consistent multi-key updates), and support for high-level data types (developer friendly API) with safe resolution of concurrent updates (guaranteeing convergence). These guarantees minimise the anomalies caused by parallelism and distribution, thus facilitating the development of applications. This paper presents the protocols for highly available transactions, and an experimental evaluation showing that Cure is able to achieve scalability similar to eventually-consistent NoSQL databases, while providing stronger guarantees.


Other [cs.OH]
Fichier principal
Vignette du fichier
paper (1).pdf (285.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01350558 , version 1 (02-08-2016)



Deepthi Devaki Akkoorath, Alejandro Tomsic, Manuel Bravo, Zhongmiao Li, Tyler Crain, et al.. Cure: Strong semantics meets high availability and low latency. Int. Conf. on Distributed Computing Systems (ICDCS 2016), Jun 2016, Nara, Japan. pp.405-414, ⟨10.1109/ICDCS.2016.98⟩. ⟨hal-01350558⟩
420 View
566 Download



Gmail Facebook X LinkedIn More