Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Temporal Index Sharding for Space-time Efficiency in Archive Search

Anand, A., Bedathur, S., Berberich, K., & Schenkel, R. (2011). Temporal Index Sharding for Space-time Efficiency in Archive Search. In W.-Y. Ma, J.-Y. Nie, R. A. Baeza-Yates, T.-S. Chua, & W. B. Croft (Eds.), SIGIR’11 (pp. 545-554). New York, NY: ACM. doi:10.1145/2009916.2009991.

Item is

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Anand, Avishek1, Autor           
Bedathur, Srikanta1, Autor           
Berberich, Klaus1, Autor           
Schenkel, Ralf1, Autor           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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, document collections, wikis, and so on. Typical approaches for efficient evaluation of these queries involve \emph{slicing} along the time-axis either the entire collection~\cite{253349}, or individual index lists~\cite{kberberi:sigir2007}. Both these methods are not satisfactory since they sacrifice compactness of index for processing efficiency making them either too big or, otherwise, too slow. We present a novel index organization scheme that \emph{shards} the index with \emph{zero increase in index size}, still minimizing the cost of reading index index entries during query processing. Based on the optimal sharding thus obtained, we develop practically efficient sharding that takes into account the different costs of random and sequential accesses. Our algorithm merges shards from the optimal solution carefully to allow for few extra sequential accesses while gaining significantly by reducing the random accesses. Finally, we empirically establish the effectiveness of our novel sharding scheme via detailed experiments over the edit history of the English version of Wikipedia between 2001-2005 ($\approx$ 700 GB) and an archive of the UK governmental web sites ($\approx$ 400 GB). Our results demonstrate the feasibility of faster time-travel query processing with no space overhead.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 20112011
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 618955
DOI: 10.1145/2009916.2009991
URI: http://doi.acm.org/10.1145/2009916.2009991
Anderer: Local-ID: C1256DBF005F876D-CBF71516EA666361C125786F002D8E69-BedathurABS2011
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 34th International ACM SIGIR Conference on Research and Development in Information Retrieval
Veranstaltungsort: Beijing, China
Start-/Enddatum: 2011-07-24 - 2011-07-28

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: SIGIR’11
  Untertitel : Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval
  Kurztitel : SIGIR 2011
Genre der Quelle: Konferenzband
 Urheber:
Ma, Wei-Ying1, Herausgeber
Nie, Jian-Yun1, Herausgeber
Baeza-Yates, Ricardo A.1, Herausgeber
Chua, Tat-Seng1, Herausgeber
Croft, W. Bruce1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: New York, NY : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 545 - 554 Identifikator: ISBN: 978-1-4503-0757-4