Sciweavers

Share
PLDI
2015
ACM

Declarative programming over eventually consistent data stores

5 years 4 days ago
Declarative programming over eventually consistent data stores
User-facing online services utilize geo-distributed data stores to minimize latency and tolerate partial failures, with the intention to provide a fast, always-on experience. However, geo-distribution does not come for free; application developers have to contend k consistency behaviors, and the lack of abstractions to composably construct high-level replicated data types, necessitating the need for complex application logic and invariably exposing inconsistencies to the user. Some commercial distributed data stores and several academic proposals provide a lattice of consistency levels, with stronger consistency guarantees incurring increased latency and throughput costs. However, correctly assigning the right consistency level for an operation requires subtle reasoning and is often an error-prone task. In this paper, we present QUELEA, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained a...
K. C. Sivaramakrishnan, Gowtham Kaki, Suresh Jagan
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where PLDI
Authors K. C. Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan
Comments (0)
books