Skip to Main content Skip to Navigation

Cure: Strong semantics meets high availability and low latency

Abstract : 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 high-level data types (developer friendly) with safe resolution of concurrent updates (guaranteeing convergence). These guarantees minimise the anomalies caused by parallelism and distribution, and facilitate the development of applications. This paper presents the protocols for highly available transactions , and an experimental evaluation showing that Cure is able to achieve performance similar to eventually-consistent NoSQL databases, while providing stronger guarantees.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Tyler Crain Connect in order to contact the contributor
Submitted on : Friday, February 19, 2016 - 5:52:49 PM
Last modification on : Tuesday, January 11, 2022 - 11:16:04 AM
Long-term archiving on: : Saturday, November 12, 2016 - 11:37:41 PM


Files produced by the author(s)


  • HAL Id : hal-01270776, version 2


Deepthi Devaki Akkoorath, Alejandro Tomsic, Manuel Bravo, Zhongmiao Li, Tyler Crain, et al.. Cure: Strong semantics meets high availability and low latency. [Research Report] RR-8858, INRIA; Paris 6. 2016. ⟨hal-01270776v2⟩



Les métriques sont temporairement indisponibles