A compressed trie structure using divided keys

Authors:
Masaki Oono;El-Sayed Atlam;Masao Fuketa;Kazuhiro Morita;Jun-ichi Aoe
Affiliations:
Department of Information and Computer Science, Faculty of Science and Technology, Keio University, 3-14-1 Hiyoshi, Yokohama 223-8522, Japan.;Department of Information Science and Intelligent Systems, Faculty of Engineering, Tokushima University, 2-1 Minami josanjima, Tokushima 770-8506, Japan.;Department of Information Science and Intelligent Systems, Faculty of Engineering, Tokushima University, 2-1 Minami josanjima, Tokushima 770-8506, Japan.;Department of Information Science and Intelligent Systems, Faculty of Engineering, Tokushima University, 2-1 Minami josanjima, Tokushima 770-8506, Japan.;Department of Information Science and Intelligent Systems, Faculty of Engineering, Tokushima University, 2-1 Minami josanjima, Tokushima 770-8506, Japan
Venue:
International Journal of Computer Applications in Technology
Year:
2009

Citing 6
Cited 0

An Efficient Digital Search Algorithm by Using a Double-Array Structure

IEEE Transactions on Software Engineering
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Trie memory

Communications of the ACM
An improvement key deletion method for double-array structure using single-nodes

Information Processing and Management: an International Journal
An efficient deletion method for a minimal prefix double array: Research Articles

Software—Practice & Experience
A compact static double-array keeping character codes

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A link-trie structure is an efficient data structure for collocation information using a trie structure. The link-trie stores two basic words into the trie and defines link-information by a link-function. This paper presents how to apply the link-trie into a general set of keys and compress the storage capacity. The method divides a key into several sub-keys and defines link-information between these sub-keys. From simulation results for 100,000 keys, it turns out that the presented method compresses the storage capacity by 30% smaller than the normal trie.