An improvement key deletion method for double-array structure using single-nodes

Authors:
Masaki Oono;Masao Fuketa;Kazuhiro Morita;Shinkaku Kashiji;Jun-ichi Aoe
Affiliations:
Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Minamijosanjima-Cho 2, Tokushima City 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Minamijosanjima-Cho 2, Tokushima City 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Minamijosanjima-Cho 2, Tokushima City 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Minamijosanjima-Cho 2, Tokushima City 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Minamijosanjima-Cho 2, Tokushima City 770-8506, Japan
Venue:
Information Processing and Management: an International Journal
Year:
2004

Citing 9
Cited 1

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

IEEE Transactions on Software Engineering
Compressed tries

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Trie memory

Communications of the ACM
Fast insertion methods of a double-array structure

Software—Practice & Experience
Computer Programs for Spelling Correction

Computer Programs for Spelling Correction
Data Structure Techniques

Data Structure Techniques
Data Structures and Algorithms

Data Structures and Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

A compressed trie structure using divided keys

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A trie is a well known method for various dictionaries, such as spelling check and morphological analysis. A double-array structure is an efficient data structure combining fast access of a matrix form with the compactness of a list form. The drawback of the double-array is that the space efficiency degrades by empty elements produced in key deletion. Morita presented a key deletion method eliminating empty elements. However, the space efficiency of this method is low for high frequent deletion and deletion takes much time because the cost depends on the number of the empty elements. This paper presents a fast and compact deletion method by using the property of nodes that have no brothers. From simulation results for 100,000 keys, the present method is about 330 times faster than Morita's method and keeps high space efficiency.