%0 Conference Paper
%1 olston2008recrawl
%A Olston, Christopher
%A Pandey, Sandeep
%B Proceedings of the 17th international conference on World Wide Web
%C New York, NY, USA
%D 2008
%I ACM
%K crawling engine search web
%P 437--446
%T Recrawl scheduling based on information longevity
%U http://doi.acm.org/10.1145/1367497.1367557
%X It is crucial for a web crawler to distinguish between ephemeral and persistent content. Ephemeral content (e.g., quote of the day) is usually not worth crawling, because by the time it reaches the index it is no longer representative of the web page from which it was acquired. On the other hand, content that persists across multiple page updates (e.g., recent blog postings) may be worth acquiring, because it matches the page's true content for a sustained period of time.</p> <p>In this paper we characterize the longevity of information found on the web, via both empirical measurements and a generative model that coincides with these measurements. We then develop new recrawl scheduling policies that take longevity into account. As we show via experiments over real web data, our policies obtain better freshness at lower cost, compared with previous approaches.