Cache elimination method and system

Abstract

The invention discloses a cache elimination method, and the method comprises the steps: setting a first queue and a second queue, wherein the first queue is used for maintaining cache data and a unique code corresponding to each piece of data, and the second queue is used for maintaining the code and the query rate per second of each piece of data; receiving the code of the data to be queried; and initiating a query operation to the first queue according to the code, updating the first queue and the second queue when the code is not queried, and eliminating the cold data in the first queue. The invention further discloses a cache elimination system, an electronic device and a computer readable storage medium. Therefore, the hot data set, the warm data set and the cold data set in the queue can be effectively distinguished, the elimination accuracy is improved, and cache data of historical access records can be eliminated without a large amount of data access.

Description

technical field

[0001] The present application relates to the technical field of data processing, and in particular, to a cache elimination method, system, electronic device, and computer-readable storage medium. Background technique

[0002] The cache elimination algorithm is an elimination algorithm to make full use of cached data. In order to maximize the page hit rate, most operating systems widely use the LRU (Least Recently Used, least recently used) elimination algorithm. The LRU elimination algorithm maintains a queue. The Insert (insert) operation will put the data at the head of the queue, and the elimination will start from the tail of the queue, and the Key (the unique ID number of the data resource) obtained by the Lookup (query) operation will also be updated. , transfer the Key to the head of the queue. The K in the LRU-K elimination algorithm represents the threshold of the number of recent uses, which is an elimination algorithm that only enters the LRU qu...

Images