MPI-INF D1 Publications: Proceedings Article: Type Less, Find More: Fast Autocompletion Search with a Succinct Index

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

Options:

Goto entry point

Author, Editor

Author(s):

Bast, Holger
Weber, Ingmar

dblp
dblp

Editor(s):

Efthimiadis, Efthimis N.
Dumais, Susan
Hawking, David
Järvellin, Kalervo

dblp
dblp
dblp
dblp

Not MPII Editor(s):

Efthimiadis, Efthimis N.
Dumais, Susan
Hawking, David
Järvellin, Kalervo

BibTeX cite key*:

bastweber06sigir

Title, Booktitle

Title*:	Type Less, Find More: Fast Autocompletion Search with a Succinct Index
Booktitle*:	SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

Event, URLs

URL of the conference:	http://www.sigir2006.org/
URL for downloading the paper:	http://delivery.acm.org/10.1145/1150000/1148234/p364-bast.pdf?key1=1148234&key2=7596860711&coll=GUIDE&dl=GUIDE&CFID=13588648&CFTOKEN=49878423
Event Address*:	Seattle, USA	Language:	English
Event Date* (no longer used):		Organization:	Association for Computing Machinery (ACM)
Event Start Date:	6 August 2006	Event End Date:	11 August 2006

Publisher

Name*:	ACM	URL:
Address*:	New York, USA	Type:

Vol, No, Year, pp.

Series:

Volume:		Number:
Month:		Pages:	364-371
Year*:	2006	VG Wort Pages:
ISBN/ISSN:	1-59593-369-7	Sequence Number:
DOI:


(LaTeX) Abstract:	We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant display of completions of the last query word which would lead to good hits. At the same time, the best hits for any of these completions should be displayed. Known indexing data structures that apply to this problem either incur large processing times for a substantial class of queries, or they use a lot of space. We present a new indexing data structure that uses no more space than a state-of-the-art compressed inverted index, but with 10 times faster query processing times. Even on the large TREC Terabyte collection, which comprises over 25 million documents, we achieve, on a single machine and with the index on disk, average response times of one tenth of a second. We have built a full-fledged, interactive search engine that realizes the proposed autocompletion feature combined with support for proximity search, semi-structured (XML) text, subword and phrase completion, and semantic tags.
URL for the Abstract:	http://portal.acm.org/citation.cfm?doid=1148170.1148234


Download Access Level:	Internal

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Algorithms and Complexity Group
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@INPROCEEDINGS{bastweber06sigir,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Efthimiadis, Efthimis N. and Dumais, Susan and Hawking, David and J{\"a}rvellin, Kalervo},
TITLE = {Type Less, Find More: Fast Autocompletion Search with a Succinct Index},
BOOKTITLE = {SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
PUBLISHER = {ACM},
YEAR = {2006},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PAGES = {364--371},
ADDRESS = {Seattle, USA},
ISBN = {1-59593-369-7},
}

Entry last modified by Uwe Brahm, 07/18/2007

Edit History (please click the blue arrow to see the details)

	Editor(s) Ingmar Weber	Created 06/09/2006 11:59:52 AM
Revisions 8. 7. 6. 5. 4.	Editor(s) Uwe Brahm Uwe Brahm Christine Kiesel Christine Kiesel Christine Kiesel	Edit Dates 2007-07-18 14:47:08 07/07/2007 00:46:30 07.02.2007 19:13:05 05.02.2007 15:55:48 09/19/2006 04:19:48 AM