Brief announcement: Atomic consistency and partition tolerance in scalable key-value stores

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose consistent quorums to achieve linearizability in scalable and self-organizing key-value stores based on consistent hashing. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Arad, C., Shafaat, T. M., & Haridi, S. (2012). Brief announcement: Atomic consistency and partition tolerance in scalable key-value stores. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7611 LNCS, pp. 445–446). https://doi.org/10.1007/978-3-642-33651-5_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free