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 databa...

Full description

Saved in:
Bibliographic Details
Main Authors: Akkoorath, Deepthi Devaki, Tomsic, Alejandro Z., Bravo, Manuel, Zhongmiao Li, Crain, Tyler, Bieniusa, Annette, Preguica, Nuno, Shapiro, Marc
Format: Conference Proceeding
Language:English
Subjects:
Anomalies
Availability
Clocks
Computer networks
Consistency
Convergence
Cures
Developers
Distributed processing
Programming
Protocols
Semantics
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-6927
2575-8411
DOI:10.1109/ICDCS.2016.98