EH*p:一种使用奇偶编码的高可用可扩展分布式数据结构

EH*p: A Highly Available and Scalable Distributed Data Structure Using Parity Code

EH*p是一种使用奇偶编码对数据进行备份的高可用可扩展分布式数据结构。EH*p文件可以随着记录的插入而逐渐扩展到多台服务器上,并可在单服务器故障时自动对丢失的数据进行恢复。EH*p采用数据桶满后立即分裂的扩展方法,直接把记录关键字映射到服务器地址,并且把数据桶的分裂和恢复操作分配给系统中的各服务器,克服了LH*类数据结构的不足之处。实验显示,该结构的备份数据的存储消耗较小,而且单次查询所花费的消息数接近理论最小值2。

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 the server address directly,and distributes the data bucket splitting and recovering tasks to all the servers in the system, so it overcomes the drawbacks 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 query is close to the theoretical minimum value 2.