Method of distributed data redundancy storage using consistent hashing
AssigneeHere Data Technology
InventorsBin Hao, Jian Zhu, Jingyao Zhang
Life of this patent
Estimating the term…
Abstract
Disclosed is a method of distributed data redundancy storage using consistent hashing, which is used for selection of pre-stored data in the distributed position in storage cluster. The method is implemented by establishing a logical topology for each storage node in a distributed storage system, determining the position of each node in a storage node sequence corresponding to each hash subspace by using consistent hashing, and then determining a number of data copies and each piece of stored data according to the redundant storage policy of pre-stored data; and storing each piece of stored data in a different storage node according to storage rules.
Claims10
A method of distributed data redundancy storage using consistent hashing, comprising:
- a node creating step:
- establishing a logical topology for each storage node in a distributed storage system, and determining a position of each node in a storage node sequence corresponding to each hash subspace by using consistent hashing;
- a data writing step:
- determining a number of data copies and each piece of stored data according to a redundant storage policy of pre-stored data;
- and
- storing each piece of stored data in a different storage node according to storage rules.
Dependencies are inferred from the claim text.