EH*RS is a new high-availability Scalable Distributed Data Structure (SDDS). The file structure and the search performance of EH*RS are basically these of EH*. It gets high availability based on record group and Reed-Salomon erasure correcting coding. EH*RS remains all data available despite the unavailability of any k >1 servers by storing the additional information: the parity information. The value of k transparently grows with the file, to prevent the reliability decline. The storage overhead for the high-availability is small. The example shows that EH*RS file performs as expected. Finally, the scheme of EH*RS provides new perspectives to data-intensive applications (DBMSs), including the emerging ones of grids and of P2P computing. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ren, X., & Xu, X. (2007). EH*RS: A high-availability scalable distributed data structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4494 LNCS, pp. 188–197). Springer Verlag. https://doi.org/10.1007/978-3-540-72905-1_17
Mendeley helps you to discover research relevant for your work.