Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2017) | last year (2016) | two years ago (2015) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Anand, Avishek
Bedathur, Srikanta
Berberich, Klaus
Schenkel, Ralf

dblp
dblp
dblp
dblp



Editor(s):

Huang, Xiangji Jimmy
Jones, Gareth
Koudas, Nick
Wu, Xindong
Collins-Thompson, Kevyn

dblp
dblp
dblp
dblp
dblp

Not MPII Editor(s):

Huang, Xiangji Jimmy
Jones, Gareth
Koudas, Nick
Wu, Xindong
Collins-Thompson, Kevyn

BibTeX cite key*:

AnandBBS_CIKM10

Title, Booktitle

Title*:

Efficient Temporal Keyword Queries over Versioned Text

Booktitle*:

Proceedings of the 19th ACM Conference on Information and Knowledge Management (CIKM 2010)

Event, URLs

URL of the conference:


URL for downloading the paper:

http://doi.acm.org/10.1145/1871437.1871528

Event Address*:

Toronto, Canada

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

26 October 2010

Event End Date:

30 October 2010

Publisher

Name*:

ACM

URL:


Address*:

New York, NY

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

699-708

Year*:

2010

VG Wort Pages:


ISBN/ISSN:

978-1-4503-0099-5

Sequence Number:


DOI:

10.1145/1871437.1871528



Note, Abstract, ©


(LaTeX) Abstract:

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.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{AnandBBS_CIKM10,
AUTHOR = {Anand, Avishek and Bedathur, Srikanta and Berberich, Klaus and Schenkel, Ralf},
EDITOR = {Huang, Xiangji Jimmy and Jones, Gareth and Koudas, Nick and Wu, Xindong and Collins-Thompson, Kevyn},
TITLE = {Efficient Temporal Keyword Queries over Versioned Text},
BOOKTITLE = {Proceedings of the 19th ACM Conference on Information and Knowledge Management (CIKM 2010)},
PUBLISHER = {ACM},
YEAR = {2010},
PAGES = {699--708},
ADDRESS = {Toronto, Canada},
ISBN = {978-1-4503-0099-5},
DOI = {10.1145/1871437.1871528},
}


Entry last modified by Anja Becker, 01/31/2011
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
08/19/2010 02:31:45 PM
Revisions
3.
2.
1.
0.
Editor(s)
Anja Becker
Anja Becker
Ralf Schenkel
Ralf Schenkel
Edit Dates
31.01.2011 12:58:18
28.01.2011 12:17:47
19.08.2010 14:36:39
19.08.2010 14:36:14
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section