Campus Event Calendar
Event Entry
New for: D3
What and Who
Index Partitioning Strategies for Efficient Time-Travel Search
Avishek Anand
International Max Planck Research School for Computer Science - IMPRS
Talk
AG 1, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 19 November 2009
17:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
We develop a scalable peer-to-peer framework for Web archiving that
includes archival crawling, storage and indexing of the evolving
Web. We build distributed inverted index with time-stamped entries
that enables efficient historical analysis of Web data. Further, we
focus on designing strategies to partition the index such that
time-travel keyword queries can be processed efficiently while (i)
reducing the impact of churn, (ii) reducing the communication
overheads, and (iii) honoring the limited storage resource at each
peer.
includes archival crawling, storage and indexing of the evolving
Web. We build distributed inverted index with time-stamped entries
that enables efficient historical analysis of Web data. Further, we
focus on designing strategies to partition the index such that
time-travel keyword queries can be processed efficiently while (i)
reducing the impact of churn, (ii) reducing the communication
overheads, and (iii) honoring the limited storage resource at each
peer.
Contact
imprs
225
--email hidden
passcode not visible
logged in users only
Jennifer Gerling, 11/18/2009 09:18 -- Created document.