Brief Announcement: Semantics of Eventually Consistent Replicated Sets

  • Annette Bieniusa
  • Marek Zawirski
  • Nuno Preguiça
  • Marc Shapiro
  • Carlos Baquero
  • Valter Balegas
  • Sérgio Duarte
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7611)

Abstract

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].

References

  1. 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. 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
  3. 3.
    Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: Conflict-Free Replicated Data Types. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386–400. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Annette Bieniusa
    • 1
  • Marek Zawirski
    • 1
    • 2
  • Nuno Preguiça
    • 3
    • 1
  • Marc Shapiro
    • 1
  • Carlos Baquero
    • 4
  • Valter Balegas
    • 3
  • Sérgio Duarte
    • 3
  1. 1.INRIA/LIP6ParisFrance
  2. 2.UPMCParisFrance
  3. 3.CITI, Universidade Nova de LisboaPortugal
  4. 4.HASLabINESC Tec and Universidade do MinhoPortugal

Personalised recommendations