Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Efficient Temporal Keyword Queries over Versioned Text

Anand, A., Bedathur, S., Berberich, K., & Schenkel, R. (2010). Efficient Temporal Keyword Queries over Versioned Text. In X. J. Huang, G. Jones, N. Koudas, X. Wu, & K. Collins-Thompson (Eds.), Proceedings of the 19th ACM Conference on Information and Knowledge Management (pp. 699-708). New York, NY: ACM. doi:10.1145/1871437.1871528.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-14E4-B Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-33F7-2
Genre: Konferenzbeitrag

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: Modern text analytics applications operate on large volumes of temporal text data such as Web archives, newspaper archives, blogs, wikis, and micro-blogs. In these settings, searching and mining needs to use constraints on the time dimension in addition to keyword constraints. A natural approach to address such queries is using an inverted index whose entries are enriched with valid-time intervals. It has been shown that these indexes have to be partitioned along time in order to achieve efficiency. However, when the temporal predicate corresponds to a long time range, requiring the processing of multiple partitions, naive query processing incurs high cost of reading of redundant entries across partitions. We present a framework for efficient approximate processing of keyword queries over a temporally partitioned inverted index which minimizes this overhead, thus speeding up query processing. By using a small synopsis for each partition we identify partitions that maximize the number of final non-redundant results, and schedule them for processing early on. Our approach aims to balance the estimated gains in the final result recall against the cost of index reading required. We present practical algorithms for the resulting optimization problem of index partition selection. Our experiments with three diverse, large-scale text archives reveal that our proposed approach can provide close to 80\% result recall even when only about half the index is allowed to be read.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 20102010
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 536378
DOI: 10.1145/1871437.1871528
URI: http://doi.acm.org/10.1145/1871437.1871528
Anderer: Local-ID: C1256DBF005F876D-63EEA22E6EFA1620C12577840044D36B-AnandBBS_CIKM10
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 19th ACM Conference on Information and Knowledge Management
Veranstaltungsort: Toronto, Canada
Start-/Enddatum: 2010-10-26 - 2010-10-30

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 19th ACM Conference on Information and Knowledge Management
  Kurztitel : CIKM 2010
Genre der Quelle: Konferenzband
 Urheber:
Huang, Xiangji Jimmy1, Herausgeber
Jones, Gareth1, Herausgeber
Koudas, Nick1, Herausgeber
Wu, Xindong1, Herausgeber
Collins-Thompson, Kevyn1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: New York, NY : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 699 - 708 Identifikator: ISBN: 978-1-4503-0099-5