English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Pocket Guide to Web History

MPS-Authors
/persons/resource/persons44119

Berberich,  Klaus
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons44104

Bedathur,  Srikanta
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Berberich, K., Bedathur, S., & Weikum, G. (2007). A Pocket Guide to Web History. In I. Ziviani, & R. Baeza-Yates (Eds.), String Processing and Information Retrieval: 14th International Symposium, SPIRE 2007 (pp. 86-97). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1E1B-3
Abstract
Web archives like the {I}nternet {A}rchive preserve the evolutionary history of large portions of the {W}eb. Access to them, however, is still via rather limited interfaces – a search functionality is often missing or ignores the time axis. Time-travel search alleviates this shortcoming by enriching keyword queries with a time-context of interest. In order to be effective, time-travel queries require historical {P}age{R}ank scores. In this paper, we address this requirement and propose rank synopses as a novel structure to compactly represent and reconstruct historical {P}age{R}ank scores. Rank synopses can reconstruct the {P}age{R}ank score of a web page as of any point during its lifetime, even in the absence of a snapshot of the {W}eb as of that time. We further devise a normalization scheme for {P}age{R}ank scores to make them comparable across different graphs. Through a comprehensive evaluation over different datasets, we demonstrate the accuracy and space-economy of the proposed methods.