Back to Search Start Over

Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores.

Authors :
Ali, Ramy E.
Cadambe, Viveck R.
Source :
IEEE Transactions on Communications. Sep2019, Vol. 67 Issue 9, p5907-5920. 14p.
Publication Year :
2019

Abstract

Motivated by applications of distributed storage systems to key-value stores, the multi-version coding problem has been formulated to efficiently store frequently updated data in asynchronous decentralized storage systems. Inspired by consistency requirements in distributed systems, the main goal in the multi-version coding problem is to ensure that the latest possible version of the data is decodable even if the data updates have not reached all the servers in the system. In this paper, we study the storage cost of ensuring consistency for the case where the data versions are correlated, in contrast to previous work where the data versions were treated as being independent. We provide multi-version code constructions that show that the storage cost can be significantly smaller than the previous constructions depending on the degree of correlation, despite the asynchrony and the decentralized nature. Our achievability results are based on Reed–Solomon codes and random binning. Through an information-theoretic converse, we show that our multi-version codes are asymptotically nearly optimal, within a factor of 2, in certain interesting regimes. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00906778
Volume :
67
Issue :
9
Database :
Academic Search Index
Journal :
IEEE Transactions on Communications
Publication Type :
Academic Journal
Accession number :
138733334
Full Text :
https://doi.org/10.1109/TCOMM.2019.2923616