Cache method and system oriented to distributed sequence list

Abstract

The invention relates to the technical field of distributed information processing, in particular to a cache method and system oriented to a distributed sequence list. The method comprises the following steps: setting basic scores for all data blocks; obtaining a data range related to a data query operation through the distributed sequence list when the data query operation is carried out; carrying out to-be-accessed access frequency statistics on each data block in the data range and accumulating the access frequency to corresponding data blocks; when the data blocks are targeted by a cache, subtracting a fixed value from the scores of the targeted data blocks; when a cache space is full, triggering a swap-out operation of the cache; and when the swap-out operation starts, sorting according to the scores of the data blocks and weeding out from the data block with the lowest score until data blocks can be increased to the cache space.

Description

technical field [0001] The invention relates to the technical field of distributed information processing, in particular to a caching method and system for a distributed sequence table. Background technique [0002] The existing NoSQL cache system generally adopts the LRU cache algorithm or an algorithm improved from the LRU cache algorithm, as follows: [0003] LRU algorithm: The LRU algorithm is based on the historical access records of the data to determine the strategy of swapping in and swapping out data. The basic idea is: the data has been accessed recently, and the probability of being accessed in the future is higher. In the specific implementation, Generally, LinkedList is used as the storage container. After being accessed, the cached object will be put back on the top of the cache. When the object is swapped out, it will start from the bottom of the cache. The specific process of the algorithm is as follows: (1) The new cached object is always placed on the top o...

AI Technical Summary

Problems solved by technology

[0006] The various algorithms mentioned above determine the swap-in and swap-out strategy based on the past access history of the data, but it is difficult to accurately predict the future based on the access history of the data alone, resulting in a low cache hit rate and poor cache performance. The data reading throughput is not high. Therefore, to further improve the cache hit rate, some other information needs to be considered. In the specific implementation of the distributed sequence table, the access mode characteristics of the query operation can be used to improve the cache hit rate.

Images