Non-Interleaving Operational Semantics for Geographically Replicated Databases
Date of Issue2013-09-23
International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) (15th:2013:Timisoara)
School of Computer Engineering
For scalable distributed database systems, weak consistency models are essential. Distributed databases, such as Google Spanner, scale to millions of nodes that replicate data across datacentres possibly located on different continents. At this scale, it is infeasible to maintain serialisability, which assumes that a global total order over committed transactions can be established. Instead, weaker consistency models, such as eventual consistency, causal consistency, sequential consistency and external consistency, are assumed. The problem is that operational models, such as labelled transition systems, tend to assume an interleaving semantics, which serialises transactions. To address this limitation, we provide an operational model that allows a weaker notion of consistency for a geographically distributed database inspired by Spanner. We reduce the timing guarantees provided by Spanner's TrueTime protocol to causal dependencies that are specified in a formal calculus.
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/SYNASC.2013.64].