Skip to Main content Skip to Navigation
Conference papers

LiveRank: How to Refresh Old Crawls

Abstract : This paper considers the problem of refreshing a crawl. More precisely, given a collection of Web pages (with hyperlinks) gathered at some time, we want to identify a significant fraction of these pages that still exist at present time. The liveness of an old page can be tested through an online query at present time. We call LiveRank a ranking of the old pages so that active nodes are more likely to appear first. The quality of a LiveRank is measured by the number of queries necessary to identify a given fraction of the alive pages when using the LiveRank order. We study different scenarios from a static setting where the LiveRank is computed before any query is made, to dynamic settings where the LiveRank can be updated as queries are processed. Our results show that building on the PageRank can lead to efficient LiveRanks for Web graphs.
Keywords : Pagerank LiveRank crawl
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Wednesday, December 10, 2014 - 12:08:39 PM
Last modification on : Friday, January 21, 2022 - 3:15:03 AM
Long-term archiving on: : Saturday, April 15, 2017 - 6:36:18 AM


Files produced by the author(s)



The Dang Huynh, Fabien Mathieu, Laurent Viennot. LiveRank: How to Refresh Old Crawls. Algorithms and Models for the Web Graph - 11th International Workshop (WAW 2014), Dec 2014, Beijing, China. pp.148 - 160, ⟨10.1007/978-3-319-13123-8_12⟩. ⟨hal-01093188⟩



Les métriques sont temporairement indisponibles