FIFO, LRU, LFU three algorithms

When it comes to caching, there are two points that must be considered:
(1) The consistency of the cached data and the target data.
(2) Expiration policy (mechanism) of the cache.
Among them, the expiration policy of the cache involves the elimination algorithm. There are several common algorithms for elimination:
(1) Fifo:firstin first Out, FIFO
(2) lru:leastrecently used, least recently used
(3) lfu:leastfrequently used, most infrequently used
Note the difference between LRU and LFU. The LFU algorithm selects the least-used data item based on the number of times the data item is used, which is determined by the difference in usage times. LRU is determined by the difference in usage time.
A good caching framework must implement all of the above caching mechanisms.

FIFO, LRU, LFU three algorithms