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 n...

Full description

Saved in:
Bibliographic Details
Main Authors: Yata, Susumu, Morita, Kazuhiro, Fuketa, Masao, Aoe, Jun-ichi
Format: Conference Proceeding
Language:English
Subjects:
Acceleration
Application software
Computer applications
Costs
Information science
Intelligent systems
Large-scale systems
Probability distribution
succinct tree
Time factors
trie
User interfaces
weighted key completion
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICCEA.2010.64