An efficient deletion method for a minimal prefix double array: Research Articles

Authors:
Susumu Yata;Masaki Oono;Kazuhiro Morita;Masao Fuketa;Jun-Ichi Aoe
Affiliations:
Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, 2-1 Minamijosanjima, Tokushima 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, 2-1 Minamijosanjima, Tokushima 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, 2-1 Minamijosanjima, Tokushima 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, 2-1 Minamijosanjima, Tokushima 770-8506, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, 2-1 Minamijosanjima, Tokushima 770-8506, Japan
Venue:
Software—Practice & Experience
Year:
2007

Citing 4
Cited 2

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
Computer Programs for Spelling Correction

Computer Programs for Spelling Correction

A compressed trie structure using divided keys

International Journal of Computer Applications in Technology
New methods for compression of MP double array by compact management of suffixes

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A minimal prefix (MP) double array is an efficient data structure for a trie. The MP double array only requires a small amount of space and enables fast retrieval. However, the space efficiency of the MP double array is degraded by deletion. This paper presents a fast and compact adaptive deletion method for the MP double array. The presented method is implemented with C. Simulation results for English and Japanese keys show that the adaptive method is faster than the conventional method and maintains higher space efficiency. Copyright © 2006 John Wiley & Sons, Ltd.