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 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 Quelea, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained application-level 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 Quelea on top of an off-the-shelf ECDS, and provide support for coordination-free transactions. Several benchmarks including two large web applications, illustrate the effectiveness of our approach.
Wed 17 JunDisplayed time zone: Tijuana, Baja California change
09:15 - 10:55
|Declarative Programming over Eventually Consistent Data Stores|
KC Sivaramakrishnan University of Cambridge, Gowtham Kaki Purdue University, Suresh Jagannathan Purdue UniversityMedia Attached
|Blame and coercion: Together again for the first time|
Jeremy G. Siek Indiana University, Peter Thiemann University of Freiburg, Philip Wadler University of EdinburghMedia Attached
|Lightweight, Flexible Object-Oriented Generics|
Yizhou Zhang Cornell University, Andrew C. Myers , Barbara Liskov MIT, Guido Salvaneschi TU Darmstadt, Matt Loring Cornell UniversityMedia Attached
|Relatively Complete Counterexamples for Higher-Order Programs|
Research PapersMedia Attached