This paper studies the semantics of sets under eventual consistency. The set is a pervasive data type, used either directly or as a component of more complex data types, such as maps or graphs. Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency (e.g., linearisability). Accordingly, several cloud computing platforms implement eventually-consistent replicated sets [2,4].
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2012|
|Event||26th International Symposium on Distributed Computing, DISC 2012 - |
Duration: 1 Jan 2012 → …
|Conference||26th International Symposium on Distributed Computing, DISC 2012|
|Period||1/01/12 → …|