Abstract
We present an approach for data encoding and recovery of lost information in a distributed database system. The dependencies between the informational redundancy of the database and its recovery rate are investigated, and fast recovery algorithms are developed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fernau, H.: Complexity of a {0,1}-matrix problem. Austral. J. Combin. 29, 273–310 (2004)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, Parts I, II (3rd repr.), vol. 16, XX, 762. North-Holland Mathematical Library, Amsterdam etc., North-Holland, Elsevier (1985)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bezrukov, S.L., Leck, U., Piotrowski, V.P. (2013). On Data Recovery in Distributed Databases. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)