Brief Announcement: Semantics of Eventually Consistent Replicated Sets
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].
- 1.Aslan, K., Molli, P., Skaf-Molli, H., Weiss, S.: C-Set: a commutative replicated data type for semantic stores. In: Int. W. on REsource Discovery, RED (2011)Google Scholar
- 2.DeCandia, G., Hastorun, D., et al.: Dynamo: Amazon’s highly available key-value store. In: Symp. on Op. Sys. Principles, SOSP (2007)Google Scholar
- 4.Sovran, Y., Power, R., Aguilera, M.K., Li, J.: Transactional storage for geo-replicated systems. In: Symp. on Op. Sys. Principles, SOSP (2011)Google Scholar