Affiliation:
1. INESC-ID/Technical University Lisbon, Portugal
Abstract
We analyze state-of-the art solutions, discussing their strengths and weaknesses along three main effectiveness dimensions: (i) faster strong consistency, (ii) with less aborted work, while (iii) minimizing both the amount of data exchanged between and stored at replicas; and identify open research issues.
Reference111 articles.
1. Agrawal, D. El Abbadi, A., & Steinke, R. C. (1997). Epidemic algorithms in replicated databases (extended abstract). In PODS ’97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 161–172, New York, NY, USA, 1997. ACM.
2. Almeida, J. B., Almeida, P. S., & Baquero, C. (2004). Bounded version vectors. In Rachid Guerraoui, (Ed.), Proceedings of DISC 2004: 18th International Symposium on Distributed Computing, number 3274 in LNCS, pages 102–116. Springer Verlag.
3. Almeida, P. S., Baquero, C., & Fonte, F. (2002). Version stamps - decentralized version vectors. In Proc. of the 22nd International Conference on Distributed Computing Systems.
4. Amir, Y., & Wool, A. (1996). Evaluating quorum systems over the internet. In Symposium on Fault-Tolerant Computing, pages 26–35.
5. Baldoni, R., Guerraoui, R., Levy, R. R., Quéma, V., & Piergiovanni, S. T. (2006). Unconscious Eventual Consistency with Gossips. In Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006).