English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Pocket Guide to Web History

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1E1B-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1E1D-0
Genre: Conference Paper

Files

show Files
hide Files
:
spire2007.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
spire2007.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Berberich, Klaus1, Author           
Bedathur, Srikanta1, Author           
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-192007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356460
DOI: 10.1007/978-3-540-75530-2_8
Other: Local-ID: C12573CC004A8E26-D649F6D77DA151A1C125730000447FCE-BerberichBW2007
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Santiago, Chile
Start-/End Date: 2007-06-20 - 2007-06-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: String Processing and Information Retrieval : 14th International Symposium, SPIRE 2007
Source Genre: Proceedings
 Creator(s):
Ziviani, Ivio, Editor
Baeza-Yates, Ricardo, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 86 - 97 Identifier: ISBN: 978-3-540-75529-6

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 4726 Sequence Number: - Start / End Page: - Identifier: -