Totally ordered replication for massive scale key-value stores

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

Abstract

Scalability is one of the most relevant features of today’s data management systems. In order to achieve high scalability and availability, recent distributed key-value stores refrain from costly replica coordination when processing requests. However, these systems typically do not perform well under churn. In this paper, we propose DataFlagons, a large-scale key-value store that integrates epidemic dissemination with a probabilistic total order broadcast algorithm. By ensuring that all replicas process requests in the same order, DataFlagons provides probabilistic strong data consistency while achieving high scalability and robustness under churn.

Cite

CITATION STYLE

APA

Ribeiro, J., Machado, N., Maia, F., & Matos, M. (2018). Totally ordered replication for massive scale key-value stores. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10853 LNCS, pp. 58–74). Springer Verlag. https://doi.org/10.1007/978-3-319-93767-0_5

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