Unverified50% confidenceFactExact time
LRU (Least Recently Used) is a cache eviction algorithm whose core idea is to evict the data that has not been accessed for the longest time.
1
Sources
50%
Confidence
Long-term
Relevance
9/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe classic LRU algorithm is prone to cache pollution in one-time large-batch read scenarios such as full-table scans, evicting hot data from the cache.73% similarUnverifiedLSTM通过门控机制维护隐藏状态处理序列数据，解决了简单RNN的梯度消失问题62% similarUnverifiedRedis 4.0引入LFU策略，使用Morris概率计数器以8位空间记录访问频次，并通过可配置的衰减因子（lfu-decay-time）避免历史热点数据长期占据内存61% similarUnverifiedAdvanced caching strategies require additional metadata tracking, scoring computation, and maintenance costs, and after accounting for these overheads, their net gain relative to LRU may shrink substantially.60% similarUnverifiedSoft deletion refers to not immediately removing data from physical storage when deleting a record, but instead marking it as logically deleted via a flag bit, used to support data recovery, audit trails, and to avoid the performance overhead of frequent physical deletions.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/917165API
curl https://kongchang.com/api/v1/knowledge/claims/917165MCP
get_claim(id=917165)