redis lru实现策略

点击(此处)折叠或打开

1. # MAXMEMORY POLICY: how Redis will select what to remove when maxmemory
   
2. # is reached. You can select among five behaviors:
   
3. #
   
4. # volatile-lru -> Evict using approximated LRU among the keys with an expire set. //在设置了过期时间的key中，使用近似的lru淘汰策略
   
5. # allkeys-lru -> Evict any key using approximated LRU. //所有的key均使用近似的lru淘汰策略
   
6. # volatile-lfu -> Evict using approximated LFU among the keys with an expire set. //在设置了过期时间的key中，使用lfu淘汰策略
   
7. # allkeys-lfu -> Evict any key using approximated LFU. //所有的key均使用lfu淘汰策略
   
8. # volatile-random -> Remove a random key among the ones with an expire set. //在设置了过期时间的key中，使用随机淘汰策略
   
9. # allkeys-random -> Remove a random key, any key. //所有的key均使用随机淘汰策略
   
10. # volatile-ttl -> Remove the key with the nearest expire time (minor TTL) //使用ttl淘汰策略
    
11. # noeviction -> Don't evict anything, just return an error on write operations . //不允许淘汰，在写操作发生，但内存不够时，将会返回错误
    
12. #
    
13. # LRU means Least Recently Used
    
14. # LFU means Least Frequently Used
    
15. #
    
16. # Both LRU, LFU and volatile-ttl are implemented using approximated
    
17. # randomized algorithms.