A quorum-based data consistency approach for non-relational database
Quorum algorithm has become one of the most widely adopted approaches for storing data in the failure-prone distributed storage systems. In this paper, a new approach is proposed which is able to set different levels of data consistency in key-value NoSQL databases. The proposed approach is based on...
Gespeichert in:
Veröffentlicht in: | Cluster computing 2022-04, Vol.25 (2), p.1515-1540 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Quorum
algorithm has become one of the most widely adopted approaches for storing data in the failure-prone distributed storage systems. In this paper, a new approach is proposed which is able to set different levels of data consistency in key-value
NoSQL
databases. The proposed approach is based on the parameters set in the
NoSQL
-dependent structure and is applied to distributed systems, using the quorum algorithm to adjust the consistency and to determine the different grades of data. In this paper, different data writing and reading and mix reading/writing operations are implemented test-bed to study the performance of the proposed approach. In addition to its main goal for improving data consistency, the proposed approach also satisfies the accepted compromise between the pillars of the
CAP
and
PACELC
theorems. Evaluation of the results shows that the objectives for consistency and efficiency of the proposed approach have been met. |
---|---|
ISSN: | 1386-7857 1573-7543 |
DOI: | 10.1007/s10586-021-03531-w |