Data storage method and terminal based on consistent hash algorithm

Abstract

The invention provides a data storage method and terminal based on a consistent hash algorithm, and the method comprises the steps: mapping a physical disk into more than one virtual node, and calculating a first hash value of each virtual node; arranging all virtual nodes according to the size sequence of first hash values to form a hash ring; receiving a file storage request, wherein the file storage request comprises a to-be-stored file and a file name; calculating a second hash value corresponding to the filename, finding a first hash value closest to the second hash value on the hash ringaccording to a preset direction, and storing the to-be-stored file corresponding to the filename to a physical disk where a virtual node corresponding to the first hash value closest to the second hash value is located. The single physical disk is mapped into the plurality of virtual nodes, and the file name is used as the key value to identify the to-be-stored file, so that the file searching efficiency is improved.

Description

technical field [0001] The invention relates to the field of data storage, in particular to a data storage method and terminal based on a consistent hash algorithm. Background technique [0002] In recent years, with the explosive growth of data scale, higher requirements have been placed on the storage redundancy and performance of disks; the traditional disk management method is to use RAID (Redundant Arrays of Independent Disks, Redundant Array of Independent Disks) technology , through the way of hardware RAID or software RAID, the disks are formed into a disk pool to realize redundant storage; the emergence of erasure code technology later provides a better solution for data redundant storage. Compared with traditional RAID technology, erasure coding can achieve better disk redundancy, less reconstruction time, and better data access performance, greatly improving disk usage efficiency. [0003] However, the traditional distributed hash algorithm faces the problem of u...

AI Technical Summary

Problems solved by technology

[0003] However, the traditional distributed hash algorithm faces the problem of uneven distribution of nodes, especially after dynamically adding nodes, even if the original distribution is uniform, it is difficult to ensure that it will continue to be uniform

As a result, another serious disadvantage is that when a node is abnormal, all the pressure of the node is transferred to an adjacent node. When a new node is added, it can only share the pressure for an adjacent node.

Images