Status: New
Owner: ----
Labels: Type-Defect Priority-Medium
New issue 372 by [email protected]: no way to get without bumping LRU,
aka "peek"
http://code.google.com/p/memcached/issues/detail?id=372
I have a very (very) large application which uses memcached to cache
complex objects that are slow to assemble from multiple databases, some of
which are edited by external processes without notification.
I also have a lazy scan process which slowly loops through every possible
object, recomputes the object, and compares it to what is in memcached. If
there is a mismatch (likely due to an external edit), it is reported and
then the memcached entry is replaced.
So far, so good! However, this lazy scan totally defeats memcached's LRU
eviction strategy, because my lazy scan has to "get" every possible key in
a fixed order.
What is missing is a way to perform a "peek" that retrieves the data from
memcached but does not actually count as a "get", so that I can make sure
the data is still valid without re-ordering the LRU.
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
---
You received this message because you are subscribed to the Google Groups "memcached" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
