DocumentCode :
2048409
Title :
Customized Tries for Weighted Key Completion
Author :
Yata, Susumu ; Morita, Kazuhiro ; Fuketa, Masao ; Aoe, Jun-Ichi
Author_Institution :
Dept. of Inf. Sci. & Intell. Syst., Univ. of Tokushima, Tokushima, Japan
Volume :
1
fYear :
2010
fDate :
19-21 March 2010
Firstpage :
286
Lastpage :
290
Abstract :
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.
Keywords :
dynamic programming; human computer interaction; customized tries; human-computer interaction; less memory devices; time-critical systems; weighted key completion; Acceleration; Application software; Computer applications; Costs; Information science; Intelligent systems; Large-scale systems; Probability distribution; Time factors; User interfaces; succinct tree; trie; weighted key completion;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering and Applications (ICCEA), 2010 Second International Conference on
Conference_Location :
Bali Island
Print_ISBN :
978-1-4244-6079-3
Electronic_ISBN :
978-1-4244-6080-9
Type :
conf
DOI :
10.1109/ICCEA.2010.64
Filename :
5445822
Link To Document :
بازگشت