Posted on: 07/22/08 01:12PM
(The "quote" button under the post doesn't work in FF3: "missing ; before statement" JS error, though it's not kind enough to show which statement.)
That's more or less the same as Danbooru's memcached-based caching, which works fine. It just keys to the search parameters, stores the entire HTML result (not SQL queries; the HTML formatting is what takes it the most time), and stores it in memory (not disk).
But what I was originally referring to was that a huge number of thumbs are very rarely going to be seen. How many of those 300-6000 thumbs/sec tend to be common, and how many are rare and unlikely to be repeated often? In other words, are so many requests made to random, unpredictable images that doing a large MRU cache wouldn't work?