Dynamically adjusted cache data management and elimination method

Abstract

The invention discloses a dynamically adjusted cache data management and elimination method. According to the invention, the position of the cache item in the memory is dynamically adjusted accordingto the access time and hit frequency attribute of the cache item. The memory is divided into a hot data area and a cold data area, the cache items with high hit frequency and short access time are kept at the front part of the hot data area, and the cache items with low hit frequency and long access time are kept at the tail part of the cold data area. When the cache capacity reaches a threshold value and data needs to be eliminated, cache items at the tail part of the cold data area is directly deleted. Accurate elimination of data is realized through dynamic adjustment of the cold and hot data area, the proportion of hotspot data in cache is increased, the cache pollution problem is relieved, and the cache hit rate is increased.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a method for managing and replacing cached data. Background technique [0002] In a software system, there are a large number of data read operations. The data is stored in the database, the user sends a request, and the server processes it. It needs to go through three steps: establishing a database connection, executing SQL commands, and returning query results. This will bring additional resource consumption and increase system response time. In the actual business system, there are many repeated reading operations. If the data can be cached in the memory of the server, the next time the user requests, it can be directly read from the memory, which can avoid the overhead of connecting to the database and improve the system response. speed. [0003] Caching is of great significance to system optimization, but the memory space of the server is limited, and too much memory us...

AI Technical Summary

Problems solved by technology

[0005] But both LFU and LRU have cache pollution problems

LFU has no way to be responsible for some cache items that are often used in the past and are now hardly used. Historical hot data pollutes current hot data; LRU is susceptible to sporadic batch operations. A large amount of temporary data floods into the cache, crowding out hot data, resulting in hot hit rates Sharp drop, severe cache pollution

Images