3 ms·
LRU has also memory overhead. So storing more data and using a less precise algorithm may be indeed better in some circumstances. Also there is no way to mount
by antirez 16y ago
LRU has also memory overhead. So storing more data and using a less precise algorithm may be indeed better in some circumstances.
Also there is no way to mount a precise LRU schema that is O(1). O(log(N)) complexity is needed.
- wanderr 16y agoDo you know how memcached does it? Do they pay the performance overhead, or do they cheat in some way? I don't think perfect LRU is needed, but the general idea behind LRU works /very/ well for a memcached style cache. Trying to achieve something similar using Redis by for example updating the expire on every read would be a bit of a pain and I think put extra load on the client and server. This isn't a complaint about Redis though, it has its own use cases which are wonderful and I have no objection to using both for their strengths.