An efficient deletion method for a minimal prefix double array

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.

[1]  Masao Fuketa,et al.  A fast and compact elimination method of empty elements from a double‐array structure , 2003, Softw. Pract. Exp..

[2]  Masao Fuketa,et al.  Implementation of update algorithms for a double-array structure , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[3]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[4]  Jun-Ichi Aoe.  An Efficient Digital Search Algorithm by Using a Double-Array Structure , 1989, IEEE Trans. Software Eng..

[5]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.