Article

A time machine for text search

Authors:

Klaus Berberich,

Srikanta Bedathur,

Thomas Neumann,

Gerhard WeikumAuthors Info & Claims

SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval

Pages 519 - 526

https://doi.org/10.1145/1277741.1277831

Published: 23 July 2007 Publication History

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.

References

[1]

V. N. Anh and A. Moffat. Pruned Query Evaluation Using Pre-Computed Impacts. In SIGIR, 2006.

Digital Library

[2]

V. N. Anh and A. Moffat. Pruning Strategies for Mixed-Mode Querying. In CIKM, 2006.

Digital Library

[3]

P. G. Anick and R. A. Flynn. Versioning a Full-Text Information Retrieval System. In SIGIR, 1992.

Digital Library

[4]

R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.

Digital Library

[5]

K. Berberich, S. Bedathur, T. Neumann, and G. Weikum. A Time Machine for Text search. Technical Report MPI-I-2007-5-002, Max-Planck Institute for Informatics, 2007.

Digital Library

[6]

M. H. Böhlen, R. T. Snodgrass, and M. D. Soo. Coalescing in Temporal Databases. In VLDB, 1996.

Digital Library

[7]

P. Boldi, M. Santini, and S. Vigna. Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. In WAW, 2004.

[8]

A. Z. Broder, N. Eiron, M. Fontoura, M. Herscovici, R. Lempel, J. McPherson, R. Qi, and E. J. Shekita. Indexing Shared Content in Information Retrieval Systems. In EDBT, 2006.

Digital Library

[9]

C. Buckley and A. F. Lewit. Optimization of Inverted Vector Searches. In SIGIR, 1985.

Digital Library

[10]

M. Burrows and A. L. Hisgen. Method and Apparatus for Generating and Searching Range-Based Index of Word Locations. U.S. Patent 5,915,251, 1999.

[11]

S. Büttcher and C. L. A. Clarke. A Document-Centric Approach to Static Index Pruning in Text Retrieval Systems. In CIKM, 2006.

Digital Library

[12]

D. Carmel, D. Cohen, R. Fagin, E. Farchi, M. Herscovici, Y. S. Maarek, and A. Soffer. Static Index Pruning for Information Retrieval Systems. In SIGIR, 2001.

Digital Library

[13]

http://www.europarchive.org.

[14]

R. Fagin, R. Kumar, and D. Sivakumar. Comparing Top k Lists. SIAM J. Discrete Math., 17(1):134--160, 2003.

Digital Library

[15]

R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003.

Digital Library

[16]

S. Guha, K. Shim, and J. Woo. REHIST: Relative Error Histogram Construction Algorithms. In VLDB, 2004.

Digital Library

[17]

M. Hersovici, R. Lempel, and S. Yogev. Efficient Indexing of Versioned Document Sequences. In ECIR, 2007.

Digital Library

[18]

http://www.archive.org.

[19]

Y. E. Ioannidis and V. Poosala. Balancing Histogram Optimality and Practicality for Query Result Size Estimation. In SIGMOD, 1995.

Digital Library

[20]

H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal Histograms with Quality Guarantees. In VLDB, 1998.

Digital Library

[21]

E. J. Keogh, S. Chu, D. Hart, and M. J. Pazzani. An Online Algorithm for Segmenting Time Series. In ICDM, 2001.

Digital Library

[22]

S. Kirkpatrick, D. G. Jr., and M. P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671--680, 1983.

[23]

J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley, 2005.

Digital Library

[24]

U. Manber. Introduction to Algorithms: A Creative Approach. Addison-Wesley, 1989.

Digital Library

[25]

K. Nørvåg and A. O. N. Nybø. DyST: Dynamic and Scalable Temporal Text Indexing. In TIME, 2006.

[26]

J. M. Ponte and W. B. Croft. A Language Modeling Approach to Information Retrieval. In SIGIR, 1998.

Digital Library

[27]

S. E. Robertson and S. Walker. Okapi/Keenbow at TREC-8. In TREC, 1999.

[28]

B. Salzberg and V. J. Tsotras. Comparison of Access Methods for Time-Evolving Data. ACM Comput. Surv., 31(2):158--221, 1999.

Digital Library

[29]

M. Stack. Full Text Search of Web Archive Collections. In IWAW, 2006.

[30]

E. Terzi and P. Tsaparas. Efficient Algorithms for Sequence Segmentation. In SIAM-DM, 2006.

[31]

M. Theobald, G. Weikum, and R. Schenkel. Top-k Query Evaluation with Probabilistic Guarantees. In VLDB, 2004.

Digital Library

[32]

http://www.wikipedia.org.

[33]

I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann publishers Inc., 1999.

Digital Library

[34]

J. Zhang and T. Suel. Efficient Search in Large Textual Collections with Redundancy. In WWW, 2007.

Digital Library

[35]

J. Zobel and A. Moffat. Inverted Files for Text Search Engines. ACM Comput. Surv., 38(2):6, 2006. 526.

Digital Library

Cited By

Ohr VGupta DOosterhuis HBast HXiong C(2024)Scalable Range Search over Temporal and Numerical ExpressionsProceedings of the 2024 ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3664190.3672509(91-100)Online publication date: 2-Aug-2024
https://dl.acm.org/doi/10.1145/3664190.3672509
Frew LNelson MWeigle MSerra ESpezzano F(2024)Retrogressive Document Manipulation of US Federal Environmental WebsitesProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679988(3762-3766)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679988
Frew LNelson MWeigle MKlein MBen-David AJäschke RKelly M(2024)Making Changes in Webpages Discoverable: A Change-Text Search Interface for Web ArchivesProceedings of the 2023 ACM/IEEE Joint Conference on Digital Libraries10.1109/JCDL57899.2023.00021(71-81)Online publication date: 26-Jun-2024
https://dl.acm.org/doi/10.1109/JCDL57899.2023.00021
Show More Cited By

Index Terms

A time machine for text search
1. Information systems
  1. Information retrieval

Recommendations

Index maintenance for time-travel text search
SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval

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 ...
Lifespan-based Partitioning of Index Structures for Time-travel Text Search
CIKM '15: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management

Time-travel text search over a temporally evolving document collection is useful in various applications. Supporting a wide range of query classes demanded by these applications require different index layouts optimized for their respective query access ...
Temporal index sharding for space-time efficiency in archive search
SIGIR '11: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval

Time-travel queries that couple temporal constraints with keyword queries are useful in searching large-scale archives of time-evolving content such as the web archives or wikis. Typical approaches for efficient evaluation of these queries involve ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval

July 2007

946 pages

ISBN:9781595935977

DOI:10.1145/1277741

General Chairs:
Wessel Kraaij
TNO, The Netherlands
,
Arjen P. de Vries
CWI, The Netherlands
,
Program Chairs:
Charles L. A. Clarke
University of Waterloo, Canada
,
Norbert Fuhr
University of Duisburg-Essen, Germany
,
Noriko Kando
National Institute of Informatics, Japan

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGIR07

Sponsor:

SIGIR07: The 30th Annual International SIGIR Conference

July 23 - 27, 2007

Amsterdam, The Netherlands

Acceptance Rates

Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
1,237
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ohr VGupta DOosterhuis HBast HXiong C(2024)Scalable Range Search over Temporal and Numerical ExpressionsProceedings of the 2024 ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3664190.3672509(91-100)Online publication date: 2-Aug-2024
https://dl.acm.org/doi/10.1145/3664190.3672509
Frew LNelson MWeigle MSerra ESpezzano F(2024)Retrogressive Document Manipulation of US Federal Environmental WebsitesProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679988(3762-3766)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679988
Frew LNelson MWeigle MKlein MBen-David AJäschke RKelly M(2024)Making Changes in Webpages Discoverable: A Change-Text Search Interface for Web ArchivesProceedings of the 2023 ACM/IEEE Joint Conference on Digital Libraries10.1109/JCDL57899.2023.00021(71-81)Online publication date: 26-Jun-2024
https://dl.acm.org/doi/10.1109/JCDL57899.2023.00021
Jatowt ASato MDraxl SDuan YCampos RYoshikawa M(2023)Is this news article still relevant? Ranking by contemporary relevance in archival searchInternational Journal on Digital Libraries10.1007/s00799-023-00377-y25:2(197-216)Online publication date: 28-Jul-2023
https://doi.org/10.1007/s00799-023-00377-y
Sato MJatowt ADuan YCampos RYoshikawa MDownie J(2021)Estimating Contemporary Relevance of Past NewsProceedings of the 2021 ACM/IEEE Joint Conference on Digital Libraries10.1109/JCDL52503.2021.00019(70-79)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1109/JCDL52503.2021.00019
Vo KZerr SZhu XNejdl W(2021)Efficient Scalable Temporal Web Graph Store2021 IEEE International Conference on Big Data (Big Data)10.1109/BigData52589.2021.9671984(263-273)Online publication date: 15-Dec-2021
https://doi.org/10.1109/BigData52589.2021.9671984
Xia FYang BYu CQian WZhou A(2019)Towards Longitudinal Analytics on Social Media Data2019 IEEE 35th International Conference on Data Engineering (ICDE)10.1109/ICDE.2019.00039(350-361)Online publication date: Apr-2019
https://doi.org/10.1109/ICDE.2019.00039
Bansal RRani MKumar HKaushal S(2019)Temporal Information Retrieval and Its Application: A SurveyEmerging Research in Computing, Information, Communication and Applications10.1007/978-981-13-6001-5_19(251-262)Online publication date: 11-Sep-2019
https://doi.org/10.1007/978-981-13-6001-5_19
Berberich K(2018)Web ArchivesEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4939-7131-2_128(3325-3331)Online publication date: 12-Jun-2018
https://doi.org/10.1007/978-1-4939-7131-2_128
Lin JMilligan IWiebe JZhou A(2017)WarcbaseJournal on Computing and Cultural Heritage 10.1145/309757010:4(1-30)Online publication date: 31-Jul-2017
https://dl.acm.org/doi/10.1145/3097570
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten