English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Index Maintenance for Time-Travel Text Search

Anand, A., Bedathur, S., Berberich, K., & Schenkel, R. (2012). Index Maintenance for Time-Travel Text Search. In J. Callan, W. Hersh, Y. Maarek, & M. Sanderson (Eds.), SIGIR'12 (pp. 235-244). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-59CF-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-C146-5
Genre: Conference Paper

Files

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

Locators

show

Creators

show
hide
 Creators:
Anand, Avishek1, 2, Author           
Bedathur, Srikanta1, Author           
Berberich, Klaus1, Author           
Schenkel, Ralf1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              

Content

show
hide
Free keywords: -
 Abstract: Time-travel text search enriches standard text search by temporal predicates, so that users of web archives can easily retrieve document versions that are considered relevant to a given keyword query and existed during a given time interval. Different index structures have been proposed to effciently support time-travel text search. None of them, however, can easily be updated as the Web evolves and new document versions are added to the web archive. In this work, we describe a novel index structure that effciently supports time-travel text search and can be maintained incrementally as new document versions are added to the web archive. Our solution uses a sharded index organization, bounds the number of spuriously read index entries per shard, and can be maintained using small in-memory buffers and append-only operations. We present experiments on two large-scale real-world datasets demonstrating that maintaining our novel index structure is an order of magnitude more efficient than periodically rebuilding one of the existing index structures, while query-processing performance is not adversely affected.

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 647502
DOI: 10.1145/2348283.2348318
URI: http://doi.acm.org/10.1145/2348283.2348318
Other: Local-ID: C1256DBF005F876D-391B4FB15D087619C12579F0005154F0-AnandBBS_SIGIR2012
BibTex Citekey: AnandBBS_SIGIR2012
 Degree: -

Event

show
hide
Title: International ACM SIGIR Conference on Research & Development in Information Retrieval
Place of Event: Portland, Oregon
Start-/End Date: 2012-08-12 - 2012-08-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIGIR'12
  Subtitle : The Proceedings of the International ACM SIGIR Conference on Research & Development in Information Retrieval
  Abbreviation : SIGIR 2012
Source Genre: Proceedings
 Creator(s):
Callan, Jamie1, Editor
Hersh, William1, Editor
Maarek, Yoelle1, Editor
Sanderson, Mark1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 235 - 244 Identifier: ISBN: 978-1-4503-1658-3