EH*RS: a high-availability scalable distributed data structure

Authors:
Xueping Ren;Xianghua Xu
Affiliations:
Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hanghzhou, China;Institute of Software and Intelligent Technology, Hangzhou Dianzi University, Hanghzhou, China
Venue:
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Year:
2007

Citing 11
Cited 0

LH: Linear Hashing for distributed files

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure

ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
LH*LH: A scalable High Performance Data Structure for Switched Multicomputers

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
EH* - Extendible Hashing in a Distributed Environment

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
High-Availability LH* Schemes with Mirroring

COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
LH*s: a high-availability and high-security scalable distributed data structure

RIDE '97 Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications
LH*RS---a highly-available scalable distributed data structure

ACM Transactions on Database Systems (TODS)
Report on the 7th Workshop on Distributed Data and Structures: (WDAS 2006)

ACM SIGMOD Record
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6

Quantified Score

Hi-index	0.00

Visualization

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