LH*RS - a highly-available scalable distributed data structure

@article{Litwin2005LHRSA,
  title={LH*RS - a highly-available scalable distributed data structure},
  author={Witold Litwin and Rim Moussa and Thomas J. E. Schwarz},
  journal={ACM Trans. Database Syst.},
  year={2005},
  volume={30},
  pages={769-811}
}
LH*RS is a high-availability scalable distributed data structure (SDDS). An LH*RS file is hash partitioned over the distributed RAM of a multicomputer, for example, a network of PCs, and supports the unavailability of any k ≥ 1 of its server nodes. The value of k transparently grows with the file to offset the reliability decline. Only the number of the storage nodes potentially limits the file growth. The high-availability management uses a novel parity calculus that we have developed, based… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS
33 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

53 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Patterson

  • L. HELLERSTEIN, G. GIBSON, R. KARP, R. KATZ
  • R.
  • 1994
Highly Influential
5 Excerpts

W

  • LITWIN
  • Linear Hashing: A New Tool for File and Table…
  • 1994
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…