Type less, find more

Fast autocompletion search with a succinct index

Holger Bast, Ingmar Weber

Research output: Chapter in Book/Report/Conference proceedingConference contribution

102 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Pages364-371
Number of pages8
Volume2006
Publication statusPublished - 31 Oct 2006
Externally publishedYes
Event29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - Seatttle, WA, United States
Duration: 6 Aug 200611 Aug 2006

Other

Other29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
CountryUnited States
CitySeatttle, WA
Period6/8/0611/8/06

Fingerprint

Search engines
Completion
Data structures
Query
Hits
Search Engine
Indexing
Query processing
Data Structures
XML
Subword
Semantics
Display devices
Single Machine
Query Processing
Instant
Response Time
Proximity
Display
Processing

Keywords

  • Autocompletion
  • Empirical entropy
  • Index data structure

ASJC Scopus subject areas

  • Engineering(all)
  • Information Systems
  • Software
  • Applied Mathematics

Cite this

Bast, H., & Weber, I. (2006). Type less, find more: Fast autocompletion search with a succinct index. In Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Vol. 2006, pp. 364-371)

Type less, find more : Fast autocompletion search with a succinct index. / Bast, Holger; Weber, Ingmar.

Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Vol. 2006 2006. p. 364-371.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bast, H & Weber, I 2006, Type less, find more: Fast autocompletion search with a succinct index. in Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. vol. 2006, pp. 364-371, 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seatttle, WA, United States, 6/8/06.
Bast H, Weber I. Type less, find more: Fast autocompletion search with a succinct index. In Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Vol. 2006. 2006. p. 364-371
Bast, Holger ; Weber, Ingmar. / Type less, find more : Fast autocompletion search with a succinct index. Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Vol. 2006 2006. pp. 364-371
@inproceedings{f08a432adb6546cc94ba75798a4f898d,
title = "Type less, find more: Fast autocompletion search with a succinct index",
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.",
keywords = "Autocompletion, Empirical entropy, Index data structure",
author = "Holger Bast and Ingmar Weber",
year = "2006",
month = "10",
day = "31",
language = "English",
isbn = "1595933697",
volume = "2006",
pages = "364--371",
booktitle = "Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",

}

TY - GEN

T1 - Type less, find more

T2 - Fast autocompletion search with a succinct index

AU - Bast, Holger

AU - Weber, Ingmar

PY - 2006/10/31

Y1 - 2006/10/31

N2 - 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.

AB - 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.

KW - Autocompletion

KW - Empirical entropy

KW - Index data structure

UR - http://www.scopus.com/inward/record.url?scp=33750363733&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750363733&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1595933697

SN - 9781595933690

VL - 2006

SP - 364

EP - 371

BT - Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

ER -