LH*s: a high-availability and high-security scalable distributed data structure

Author

Litwin, W. ; Neimat, M.-A. ; Lev, G. ; Ndiaye, S. ; Seck, T.

Author_Institution

Univ. Paris 9, France

fYear

1997

fDate

7-8 Apr 1997

Firstpage

141

Lastpage

150

Abstract

LH*s is high availability variant of LH*, a Scalable Distributed Data Structure. An LH*s record is striped onto different server nodes. A parity segment allows one to reconstruct the record if a segment fails. The insert or key search time is about a msec on a 10 Mb/s net, and about 100 μs at 1 Gb/s net, assuming the segments in the distributed RAM. The file size depends only on the distributed storage available, i.e., a RAM file can reach dozens of GB in practice. Data security is enhanced, as every site contains only partial and typically meaningless data. The price to pay is 20-50% more storage for the file than for an LH* file, and some additional messaging, especially for the scan search

Keywords

data structures; distributed memory systems; message passing; random-access storage; security of data; LH*; LH*s; LH*s record; RAM file; data security; distributed RAM; distributed storage; file size; high availability scalable distributed data structure; high availability variant; high security scalable distributed data structure; key search time; meaningless data; parity segment; scan search; server nodes; Data security; Data structures; High-speed networks; Laboratories; Personal communication networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Research Issues in Data Engineering, 1997. Proceedings. Seventh International Workshop on

Conference_Location

Birmingham

Print_ISBN

0-8186-7849-6

Type

conf

DOI

10.1109/RIDE.1997.583720

Filename

583720