Header menu link for other important links
Declarative programming over eventually consistent data stores
Published in Association for Computing Machinery
Volume: 2015-June
Pages: 413 - 424
User-facing online services utilize geo-distributed data stores to minimize latency and tolerate partial failures, with the intention of providing a fast, always-on experience. However, geo-distribution does not come for free; application developers have to contend with weak 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 QUELE, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained applicationlevel consistency properties. A contract enforcement system analyses contracts, and automatically generates the appropriate consistency protocol for the method protected by the contract. We describe an implementation of QUELE on top of an off-the-shelf ECDS that provides support for coordination-free transactions. Several benchmarks including two large web applications, illustrate the effectiveness of our approach. Copyright is held by the owner/author(s). Publication rights licensed to ACM.
About the journal
JournalData powered by TypesetProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
PublisherData powered by TypesetAssociation for Computing Machinery
Open AccessNo