Adaptive Caching of Fresh Web Search Results

Adaptive Caching of Fresh Web Search Results
复制标题

DOI:
10.1007/978-3-319-16354-3_13
复制
发表时间:
2015-03
期刊:
--
影响因子:
--
通讯作者:
L. Ostroumova;Yury Ustinovsky;E. Samosvat;Damien Lefortier;P. Serdyukov
L. Ostroumova;Yury Ustinovsky;E. Samosvat;Damien Lefortier;P. Serdyukov
中科院分区:
其他
文献类型:
--
作者:
L. Ostroumova;Yury Ustinovsky;E. Samosvat;Damien Lefortier;P. Serdyukov

文献摘要

被引文献

相似文献

本文研究了具有快速降级率的搜索结果缓存问题。我们提出了一种新的缓存算法,该算法基于查询频率和缓存结果的预测过时程度。我们还引入了一种新的缓存算法性能度量,称为状态度,它衡量了缓存结果的降级程度。在搜索结果频繁变化的情况下,该指标对这些变化比以前使用的陈旧流量比率更敏感。
In this paper, we study the problem of caching search results with a rapid rate of their degradation. We suggest a new caching algorithm, which is based on queries’ frequencies and the predicted staleness of cached results. We also introduce a new performance metric of caching algorithms calledstaleness degree, which measures the level of degradation of a cached result. In the case of frequently changing search results, this metric is more sensitive to those changes than the previously usedstale traffic ratio.