Data processing method and device, data access method and device and computer equipment

Abstract

The invention discloses a data processing method, a data access method, a data access device and computer equipment. The data processing method comprises the following steps: reading the access frequency of each piece of data stored in a key value storage system, wherein in each hash table of the key value storage system, an ordered linked list is adopted to store data, the data access popularityin each linked list node of the ordered linked list is sequentially reduced, and a balance tree is stored in each linked list node of the ordered linked list, performing data storage in each balance tree based on the key value size of the data; when the access frequency of the target data does not belong to an access popularity interval corresponding to the balance tree, searching a target accesspopularity interval corresponding to the access frequency of the target data; and migrating the target data to the balance tree of the linked list node corresponding to the target access popularity interval. According to the method, all the data does not need to be traversed during data access, so the read-write performance of the data can be improved; and the higher the access popularity is, theshorter the search time required for accessing of the data is.

Description

technical field [0001] The present application relates to the field of computer technology, in particular to a data processing method, device, computer equipment and storage medium, and a data access method, device, computer equipment and storage medium. Background technique [0002] With the development of technology, more and more data needs to be stored; in large-scale applications with frequent interactions (such as large-scale games), data reads and writes are more frequent, and the data read and write efficiency and read and write delay will decrease. It directly affects the user experience. In order to improve the read and write performance of data, a key-value storage system is usually deployed in front of the database to resist peak data access and protect the database from crashing. Therefore, the key-value storage system in this type of application needs to have high performance and high availability. [0003] The key-value storage engine in the prior art usually...

AI Technical Summary

Problems solved by technology

However, in such a key-value storage method, to access the data at the end of the hash collision linked list, it is necessary to traverse all the linked list nodes. The longer the data conflict linked list, the greater the time consumption and the lower the read and write performance of the data.

Images