Google TechTalks
August 14, 2006
Holger Bast
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 that yields an order of magnitude...
ididnt even know youtube let you put 47min vids on her
LilProbeinn 2 years ago
aw 47 minute that soo long am not gonna watch it
mylove1joejonas 2 years ago
lol! 47 mins gone by
emojman 3 years ago
47 minutes? o.0
roalliance10 3 years ago