The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July/August (2002 vol.14)
pp: 923-927
ABSTRACT
<p>LH*g is a high-availability extension of the LH* Scalable Distributed Data Structure. An LH*g file scales up with constant key search and insert performance, while surviving any single-site unavailability (failure). We achieve high-availability through a new principle of record grouping. A group is a logical structure of up to k records, where k is a file parameter. Every group contains a parity record allowing for the reconstruction of an unavailable member. The basic scheme may be generalized to support the unavailability of any number of sites, at the expense of storage and messaging. Other known high-availability schemes are static, or require more storage, or provide worse search performance.</p>
INDEX TERMS
Scalability, distributed systems, distributed data structures, high-availability, fault tolerance, parallelism, multicomputers.
CITATION
Witold Litwin, Tore Risch, "LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping", IEEE Transactions on Knowledge & Data Engineering, vol.14, no. 4, pp. 923-927, July/August 2002, doi:10.1109/TKDE.2002.1019223
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool