English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Phrase Query Optimization on Inverted Indexes

Anand, A., Mele, I., Bedathur, S., & Berberich, K.(2014). Phrase Query Optimization on Inverted Indexes (MPI-I-2014-5-002). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-022A-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-0233-D
Genre: Report

Files

show Files
hide Files
:
mpi-i-tr-2014-5-002.pdf (Any fulltext), 285KB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0024-022C-0
Name:
mpi-i-tr-2014-5-002.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Anand, Avishek1, Author           
Mele, Ida1, Author           
Bedathur, Srikanta1, Author           
Berberich, Klaus1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 Abstract: Phrase queries are a key functionality of modern search engines. Beyond that, they increasingly serve as an important building block for applications such as entity-oriented search, text analytics, and plagiarism detection. Processing phrase queries is costly, though, since positional information has to be kept in the index and all words, including stopwords, need to be considered. We consider an augmented inverted index that indexes selected variable-length multi-word sequences in addition to single words. We study how arbitrary phrase queries can be processed efficiently on such an augmented inverted index. We show that the underlying optimization problem is NP-hard in the general case and describe an exact exponential algorithm and an approximation algorithm to its solution. Experiments on ClueWeb09 and The New York Times with different real-world query workloads examine the practical performance of our methods.

Details

show
hide
Language(s): eng - English
 Dates: 2014
 Publication Status: Published online
 Pages: 20 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-2014-5-002
BibTex Citekey: AnandMeleBedathurBerberich2014
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: ISSN: 0946-011X