sanbat at gmail.com
Fri Sep 21 09:25:49 UTC 2007
> Well, memcache doesn't have arrays, nor does it search in the DB sense -
> pretty much anything you ask for that is in the cache will take about the
> same amount of time to find. You might grab a list of 1000 IDs, then do a
> multiget for the first 100 individual items (i.e. the first page), then
> you might have to hit the DB for any missing entries (which you would then
> cache for next time).
> MySQL is not particularly fast - I know that the Valentina database system
> is around 500% faster for an exact match on a single primary key, and that's
> supposed to be about the fastest thing you can do in MySQL. Mind you,
> Valentina is a rather different beast...
What I meant was, suppose I have a Memached list of 1000 IDs. Now I want to
search that list to see if ID 234 is in that list or not. My program logic
would have to iterate through that entire list correct? Whereas MySQL would
use its index to find it quickly.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the memcached