Limitations of highly-available eventually-consistent data stores

DOI10.1145/2767386.2767419MaRDI QIDQ2796275zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Faith Ellen, Adam Morrison

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767419

zbMATH Keywords

causal consistencyeventual consistencyreplicated data store

Mathematics Subject Classification ID

Distributed systems (68M14) Information storage and retrieval of data (68P20)

Recommendations

• Replicated data types, specification, verification, optimality
• Eventually consistent transactions
• Convergent and commutative replicated data types
• Brief Announcement
• Eventually-serializable data services

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(1)

• scientific article; zbMATH DE number 7561440 (Why is no real title available?)

This page was built for publication: Limitations of highly-available eventually-consistent data stores

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796275)