Customized Tries for Weighted Key Completion
Susumu Yata, Kazuhiro Morita, Masao Fuketa, Jun‐ichi Aoe · 2010
Key completion is to provide keys starting with a given query, and weighted key completion provides keys in order of the weight. Many systems provide key completion to assist users and weighted key completion is particularly useful to provide only selected keys. However, traditional approaches are not suited for handling many keys because of their high costs. This paper proposes a practical weighted key completion approach using a customized trie which inherits features of its base trie. For example, fast tries are suitable for time-critical systems and, in contrast, succinct tries are suitable for systems on less memory devices. Therefore, our novel approach is useful to develop a variety of systems.