Customized Tries for Weighted Key Completion

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.

[1]  M. Jakobsson,et al.  Autocompletion in full text transaction entry: a method for humanized input , 1986, CHI '86.

[2]  Sebastian Deorowicz,et al.  How to squeeze a lexicon , 2001, Softw. Pract. Exp..

[3]  Kunihiko Sadakane,et al.  Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.

[4]  H. V. Jagadish,et al.  Assisted querying using instant-response interfaces , 2007, SIGMOD '07.

[5]  Antal van den Bosch,et al.  Efficient context-sensitive word completion for mobile devices , 2008, Mobile HCI.

[6]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  R. González,et al.  PRACTICAL IMPLEMENTATION OF RANK AND SELECT QUERIES , 2005 .

[8]  Sebastiano Vigna,et al.  Broadword Implementation of Rank/Select Queries , 2008, WEA.

[9]  Naila Rahman,et al.  Engineering the LOUDS Succinct Tree Representation , 2006, WEA.

[10]  Mauro Cettolo,et al.  Efficient Handling of N-gram Language Models for Statistical Machine Translation , 2007, WMT@ACL.

[11]  Satoshi Sekine.  A Linguistic Knowledge Discovery Tool: Very Large Ngram Database Search with Arbitrary Wildcards , 2008, COLING.

[12]  Ingmar Weber,et al.  Efficient interactive query expansion with complete search , 2007, CIKM '07.

[13]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[14]  Ingmar Weber,et al.  Type less, find more: fast autocompletion search with a succinct index , 2006, SIGIR.

[15]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[16]  Takuma Kuramitsu,et al.  D-028 Insertion Method for a Double-Array Structure Based on the Set of Reachable Nodes , 2008 .

[17]  Gultekin Özsoyoglu,et al.  On content-driven search-keyword suggesters for literature digital libraries , 2008, JCDL '08.

[18]  Takashi Sato,et al.  An efficient digital search algorithm by using a double-array structure , 1988, Proceedings COMPSAC 88: The Twelfth Annual International Computer Software & Applications Conference.

[19]  Masao Fuketa,et al.  A compact static double-array keeping character codes , 2007, Inf. Process. Manag..