English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Time Machine for Text Search

Berberich, K., Bedathur, S., Neumann, T., & Weikum, G. (2007). A Time Machine for Text Search. In C. Clarke, N. Fuhr, N. Kando, W. Kraaij, & A. P. de Vries (Eds.), SIGIR'07: 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 519-526). New York, NY, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1E4C-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-41DC-F
Genre: Conference Paper

Files

show Files
hide Files
:
sigir2007.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
sigir2007.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           
Neumann, Thomas1, Author           
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 Abstract: Text search over temporally versioned document collections such as web archives has received little attention as a research problem. As a consequence, there is no scalable and principled solution to search such a collection as of a specified time. In this work, we address this shortcoming and propose an efficient solution for time-travel text search by extending the inverted file index to make it ready for temporal search. We introduce approximate temporal coalescing as a tunable method to reduce the index size without significantly affecting the quality of results. In order to further improve the performance of time-travel queries, we introduce two principled techniques to trade off index size for its performance. These techniques can be formulated as optimization problems that can be solved to near-optimality. Finally, our approach is evaluated in a comprehensive series of experiments on two large-scale real-world datasets. Results unequivocally show that our methods make it possible to build an efficient "time machine" scalable to large versioned text collections.

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-192007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356467
DOI: 10.1145/1277741.1277831
Other: Local-ID: C12573CC004A8E26-A6B6F424AE7674F9C12572B90021A0B8-BerberichBNW2007az
 Degree: -

Event

show
hide
Title: SIGIR 2007
Place of Event: Amsterdam, Netherlands
Start-/End Date: 2007-07-23 - 2007-07-27

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIGIR'07 : 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Source Genre: Proceedings
 Creator(s):
Clarke, Charlie, Editor
Fuhr, Norbert, Editor
Kando, Noriko, Editor
Kraaij, Wessel, Editor
de Vries, Arjen P., Editor
Affiliations:
-
Publ. Info: New York, NY, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 519 - 526 Identifier: ISBN: 978-1-59593-597-7