Advertisement

EH*RS: A High-Availability Scalable Distributed Data Structure

  • Xueping Ren
  • Xianghua Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4494)

Abstract

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 ≥1servers 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.

Keywords

Data Record File Size Storage Overhead Availability Level Record Group 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Special Issue on High-Performance Computing. Comm. Of ACM (1997)Google Scholar
  2. 2.
    Litwin, W., Neimat, M.-A., Schneider, D.: Linear Hashing for Distributed Files. ACM-SIGMOD International Conference on Management of Data (1993)Google Scholar
  3. 3.
  4. 4.
    Litwin, W., Neimat, M.-A., Schneider, D.: LH* - A Scalable Distributed Data Structure. ACM Trans. On Database Systems (1996)Google Scholar
  5. 5.
    Karlson, J., Litwin, W., Risch, T.: LH*LH: A Scalable High Performance Data Structure for Switched Multicomputers. In: Extending Database Technology, EDBT 1996, Springer Verlag, Heidelberg (1996)Google Scholar
  6. 6.
    Litwin, W., Moussa, R., Schwarz, T.: LH*RS – A Highly-Available Scalable Distributed Data Structure, vol.30(3). ACM Transaction on Database Systems (TODS) (2005)Google Scholar
  7. 7.
    Litwin, W.: Linear hashing: A new tool for file and table addressing. In: Proc. of VLDB, pp. 212–223 (1980)Google Scholar
  8. 8.
    Litwin, W., Neimat, M.-A., Schneider, D.: LH*: Linear Hashing for distributed files. In: ACM-SIGMOD Intl. Conference on Management of Data, pp. 327–336 (1997)Google Scholar
  9. 9.
    Litwin, W., Schwarz, T.: LH*RS: A High-Availability Scalable Distributed Data Structure using Reed Solomon Codes. ACM-SIGMOD International Conference on Management of Data (2000)Google Scholar
  10. 10.
    Litwin, W., Risch, T.: LH*g: a High-availability Scalable Distributed Data Structure through Record Grouping. Res. Rep. CERIA, U. Dauphine & U. Linkoping (1997)Google Scholar
  11. 11.
    Hilford, V., Bastani, F.B., Cukie, B.: EH*—Extenhible Hashing in a Bistributed Environment, pp. 217–222. IEEE, New York (1997)Google Scholar
  12. 12.
    Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible Hashing - A Fast Access Method for Dynamic Files. In: ACM Transactions on Database Systems, pp. 315–344 (1979)Google Scholar
  13. 13.
    Litwin, W., Neimat, M.-A.: High-Availability LH* Schemes with Mirroring. In: Intl. Conf. on Coop. Inf. Systems (COOPIS), IEEE Press, Orlando (1996)Google Scholar
  14. 14.
    Breitbart, Y., Vingralek, R.: Distributed and Scalable B+ tree Data Structures. Workshop on Distr. Data and Struct., Carleton Scientific (publ.) (1998)Google Scholar
  15. 15.
    Litwin, W., Neimat, M.-A., Levy, G., Ndiaye, S., Seck, T.: LH*S : a high-availability and high-security Scalable Distributed Data Structure. IEEE-Res. Issues in Data Eng. (RIDE-97) (1997)Google Scholar
  16. 16.
    Lindberg, R.: A Java Implementation of a Highly Available Scalable and Distributed Data Structure LH*g. Master Th. LiTH-IDA-Ex-97/65. U. Linkoping (1997)Google Scholar
  17. 17.
    Litwin, W., Menon J., Risch, T.: LH* with Scalable Availability. IBM Almaden Res. Rep. RJ 10121 (91937) (1998) Google Scholar
  18. 18.
    Gray, J., et al.: Data Mining of SDDS SkyServer Database. Intl. Workshop on Distributed Data Structures, (WDAS 2002) Carleton Scientific (2002)Google Scholar
  19. 19.
    Macwilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. Elsevier, North Holland, Amsterdam (1977)zbMATHGoogle Scholar
  20. 20.
    Xueping, R.: EH*: A High-Available Scalable Distributed Data Structure. Computer engineering and Science, China (2005)Google Scholar
  21. 21.
    Schwarz, Th., S. J., Manasse, M.: Report on the 7th workshop on Distributed Data and Structures (WDAS 2006), vol. 35(2). ACM SIGMOD Record (2006) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Xueping Ren
    • 1
  • Xianghua Xu
    • 1
  1. 1.Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hanghzhou, 310018China

Personalised recommendations