关键词: 奇偶编码 高可用性 可扩展性 分布式 数据结构

Abstract:

EH＊p is a highly available and scalable distributed data structure using parity code. An EH＊p file can scale up to many servers and can recover lost data automatically while surviving single-site failures. EH＊p splits a data bucket whenever the data bucket becomes full. EH＊p maps the record key to o the server address directly,and distributes the data bucket splitting and recovering tasks to all the servers in the system, so it overcomes the drawb  acks of the LH＊ class structures. The experiment shows that the storage overhead of the structure is moderate, and the number of messages used by per q  query is close to the theoretical minimum value 2.

Key words:  （parity code, high availability, scalability, distributed, data structure）