Posted on 02-02-2008
Filed Under (documentation) by Linux Poweruser Programmer

Type Less, Find More: Fast Autocompletion with a Succinct Index
Google engEDU
48 min – Aug 14, 2006

Google TechTalks
August 14, 2006

Holger Bast


We consider the following full-text autocompletion feature. Imagine a user of a 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 that yields an order of magnitude 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 engine that realizes the proposed autocompletion feature combined with support for proximity , semi-structured () text, subword and phrase completion, and semantic tags.
video
http://video.google.com/videoplay?docid=7012265262667474421


Sphere: Related Content

Tags: , , , , , , ,

Related posts

(1) Comment    Read More   

Comments

[...] Original post by Linux Poweruser Programmer [...]


Post a Comment
Name:
Email:
Website:
Comments: