Sparsity exploiting erasure coding for distributed storage of versioned data
From MaRDI portal
Publication:682500
DOI10.1007/S00607-016-0485-XzbMATH Open1420.94118arXiv1411.4762OpenAlexW2259778871MaRDI QIDQ682500FDOQ682500
Authors: J. Harshan, Frédérique Oggier, Anwitaman Datta
Publication date: 2 February 2018
Published in: Computing (Search for Journal in Brave)
Abstract: In this paper we study the problem of storing reliably an archive of versioned data. Specifically, we focus on systems where the differences (deltas) between subsequent versions rather than the whole objects are stored - a typical model for storing versioned data. For reliability, we propose erasure encoding techniques that exploit the sparsity of information in the deltas while storing them reliably in a distributed back-end storage system, resulting in improved I/O read performance to retrieve the whole versioned archive. Along with the basic techniques, we propose a few optimization heuristics, and evaluate the techniques' efficacy analytically and with numerical simulations.
Full work available at URL: https://arxiv.org/abs/1411.4762
Recommendations
Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
Cited In (4)
- Verifying distributed erasure-coded data
- A Layered Architecture for Erasure-Coded Consistent Distributed Storage
- Optimal erasure protection assignment for scalable compressed data with small channel packets and short channel codewords
- Modeling and optimization of latency in erasure-coded storage systems
This page was built for publication: Sparsity exploiting erasure coding for distributed storage of versioned data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682500)