Space-efficient data structures for Top-<i>k</i> completion


Virtually every modern search application, either desktop, web, or mobile, features some kind of query auto-completion. In its basic form, the problem consists in retrieving from a string set a small number of completions, i.e. strings beginning with a given prefix, that have the highest scores according to some static ranking. In this paper, we focus on… (More)
DOI: 10.1145/2488388.2488440


13 Figures and Tables

Cite this paper

@inproceedings{Hsu2013SpaceefficientDS, title={Space-efficient data structures for Top-k completion}, author={Bo-June Hsu and Giuseppe Ottaviano}, booktitle={WWW '13}, year={2013} }