The Taste Blog

Puppin et al. have a 2007 paper, “Load-Balancing and Caching for Collection Selection Architectures” (PDF) with a curious idea for optimizing large scale distributed search engines they call incremental caching.

The basic concept is to do a bit of additional work each time the cache is accessed, adding the results from that additional work to the cache. In this way, cached search results improve each time they are accessed.

From the paper:

[We] discuss a novel class of caching strategies…