On Caching Search Engine Results

In this paper we explore the problem of Caching of Search Engine Query Results, in order to reduce the computing and I/O requirements needed to support the functionality of a Search Engine on the World-Wide Web. We study query traces from real Search Engines and show that they have a significant amount of temporal locality: that is, a significant percentage of the queries have been previously submitted by the same or a different user. Using trace-driven simulation we demonstrate that medium-size caches can hold the results of most of the the frequently-submitted queries. Finally, we compare the effectiveness of static and dynamic caching and conclude that static caching is very effective particularly for small caches, like main memory caches