Treffer: 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 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. [ABSTRACT FROM AUTHOR]

Copyright of Cluster Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)