Space-efficient data structures for Top-k completion
WWW, pp. 583-594, 2013.
top-k completiondifferent trie-based data structurecompelling casemodern search applicationspace-efficient data structureMore(9+)
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 pa...More
PPT (Upload PPT)