<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06094650</id>
  <dt>a</dt>
  <an>06094650</an>
  <augroup>
    <au>Alici, Sadiye</au>
    <au>Altingovde, Ismail Sengor</au>
    <au>Ozcan, Rifat</au>
    <au>Cambazoglu, B.Barla</au>
    <au>Ulusoy, \"Ozg\"ur</au>
  </augroup>
  <ti>Adaptive time-to-live strategies for query result caching in web search engines.</ti>
  <so>Baeza-Yates, Ricardo (ed.) et al., Advances in information retrieval. 34th European conference on IR research, ECIR 2012, Barcelona, Spain, April 1--5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28996-5/pbk). Lecture Notes in Computer Science 7224, 401-412 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>search engines</ut>
    <ut>result cache</ut>
    <ut>freshness</ut>
    <ut>time-to-live</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-28997-2_34</li>
  </ligroup>
  <abgroup>
    <ab>Summary: An important research problem that has recently started to receive attention is the freshness issue in search engine result caches. In the current techniques in literature, the cached search result pages are associated with a fixed time-to-live (TTL) value in order to bound the staleness of search results presented to the users, potentially as part of a more complex cache refresh or invalidation mechanism. In this paper, we propose techniques where the TTL values are set in an adaptive manner, on a per-query basis. Our results show that the proposed techniques reduce the fraction of stale results served by the cache and also decrease the fraction of redundant query evaluations on the search engine backend compared to a strategy using a fixed TTL value for all queries.</ab>
    <rv></rv>
  </abgroup>
</item>