Admission policies for caches of search engine results (2007)
| Venue: | In Proc. of the 14th String Processing and Information Retrieval Symposium |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Baeza-yates07admissionpolicies,
author = {Ricardo Baeza-yates and Flavio Junqueira and Vassilis Plachouras and Hans Friedrich Witschel},
title = {Admission policies for caches of search engine results},
booktitle = {In Proc. of the 14th String Processing and Information Retrieval Symposium},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper studies the impact of the tail of the query distribution on caches of Web search engines, and proposes a technique for achieving higher hit ratios compared to traditional heuristics such as LRU. The main problem we solve is the one of identifying infrequent queries, which cause a reduction on hit ratio because caching them often does not lead to hits. To mitigate this problem, we introduce a cache management policy that employs an admission policy to prevent infrequent queries from taking space of more frequent queries in the cache. The admission policy uses either stateless features, which depend only on the query, or stateful features based on usage information. The proposed management policy is more general than existing policies for caching of search engine results, and it is fully dynamic. The evaluation results on two different query logs show that our policy achieves higher hit ratios when compared to previously proposed cache management policies. 1
