Design trade offs for search engine caching
Baeza Yates R., Gionis A., Junqueira F., Murdock V., Plachouras V., Silvestri F.
Caching Query logs Computer Networks and Communications Web search
In this article we study the trade-offs in designing ef?cient caching systems for Web search engines. We explore the impact of different approaches, such as static vs. dynamic caching, and caching query results vs. caching posting lists. Using a query log spanning a whole year, we explore the limitations of caching and we demonstrate that caching posting lists can achieve higher hit rates than caching query answers. We propose a new algorithm for static caching of posting lists, which outperforms previous methods. We also study the problem of ?nding the optimal way to split the static cache between answers and posting lists. Finally, we measure how the changes in the query log in?uence the effectiveness of static caching, given our observation that the distribution of the queries changes slowly over time. Our results and observations are applicable to different levels of the data-access hierarchy, for instance, for a memory/disk layer or a broker/remote server layer.
Source: ACM transactions on the web 2 (2008): 20–28. doi:10.1145/1409220.1409223
Publisher: Association for Computing Machinery, New York, N.Y. , Stati Uniti d'America
Metrics
Back to previous page
@article{oai:it.cnr:prodotti:168826,
title = {Design trade offs for search engine caching},
author = {Baeza Yates R. and Gionis A. and Junqueira F. and Murdock V. and Plachouras V. and Silvestri F.},
publisher = {Association for Computing Machinery, New York, N.Y. , Stati Uniti d'America},
doi = {10.1145/1409220.1409223},
journal = {ACM transactions on the web},
volume = {2},
pages = {20–28},
year = {2008}
}
0000-0001-7669-9055