Using weaker consistency models with monitoring and recovery for improving performance of key-value stores
Abstract Consistency properties provided by most key-value stores can be classified into sequential consistency and eventual consistency. The former is easier to program with but suffers from lower performance whereas the latter suffers from potential anomalies while providing higher performance. We...
Main Authors: | Duong Nguyen, Aleksey Charapko, Sandeep S. Kulkarni, Murat Demirbas |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-10-01
|
Series: | Journal of the Brazilian Computer Society |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13173-019-0091-9 |
Similar Items
-
Particle Swarm Optimization Algorithm for Detecting Distributed Predicates
by: Eslam Al Maghayreh, et al.
Published: (2021-01-01) -
Graphical Analysis of Rollback Process in Ad Hoc Distributed Traffic Simulation
by: Wonho Suh
Published: (2021-12-01) -
Formal analysis of control and termination of distributed computation in weaker spaces
by: Susmit Bagchi
Published: (2018-01-01) -
Algorithms And Models For Debugging Distributed Programs
by: Sampath, D
Published: (2012) -
Better Big Data Store for Real-Time Processing of Modern MRO System Via Transaction Key Groups
Published: (2018-12-01)