LH*RS: A High-Availability Scalable Distributed Data Structure using Reed Solomon Codes

Abstract

LH*RS is a new high-availability Scalable Distributed Data Structure (SDDS). The data storage scheme and the search performance of LH*RS are basically these of LH*. LH*RS manages in addition the parity information to tolerate the unavailability of k ≥ 1 server sites. The value of k scales with the file, to prevent the reliability decline. The parity calculus uses the Reed-Solomon Codes. The storage and access performance overheads to provide the high-availability are about the smallest possible. The scheme should prove attractive to data-intensive applications.