Data storage method based on distributed hash table and erasure codes

Data storage method based on distributed hash table and erasure codes

  • CN 103,561,057 A
  • Filed: 10/15/2013
  • Published: 02/05/2014
  • Est. Priority Date: 10/15/2013
  • Status: Active Application
First Claim
Patent Images

1. the date storage method based on distributed hashtable and correcting and eleting codes, is characterized in that, the method comprises the steps:

  • Node foundation step;

    set up the topological logic structure of each server node by distributed hashtable, and by consistency hash algorithm, determine the position of the server at the block piece place that each key key is corresponding;

    Data write step;

    customer end adopted correcting and eleting codes is encoded to initial data, block piece corresponding to each key is encoded to several chunk pieces, and store several chunk pieces after coding into a plurality of server nodes by write operation, wherein, the data redundancy piece that these several chunk pieces comprise predetermined quantity;

    AndData maintenance step;

    every Preset Time interval, by increase and the deletion of the protocol detection server node based on distributed hashtable, and the position of calculating the server node at each chunk piece place according to the mode of correcting and eleting codes, the number of service data redundant block remains on this predetermined quantity.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×