Fast and compact updating algorithms of a double-array structure

Authors:
Kazuhiro Morita;El-Sayed Atlam;Masao Fuketa;Kazuhiko Tsuda;Jun-ichi Aoe
Affiliations:
Department of Information Science and Intelligent Systems, University of Tokushima, 2-1 Minami Josanjima-Cho, Tokushima-Shi, 770-8506, Japan;Department of Computer Science and Statistical, Faculty of Science, Tanta University, Tanta, Egypt and Department of Information Science and Intelligent Systems, University of Tokushima, 2-1 Minam ...;Department of Information Science and Intelligent Systems, University of Tokushima, 2-1 Minami Josanjima-Cho, Tokushima-Shi, 770-8506, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, 2-1 Minami Josanjima-Cho, Tokushima-Shi, 770-8506, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, 2-1 Minami Josanjima-Cho, Tokushima-Shi, 770-8506, Japan
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2004

Citing 7
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
An Efficient Digital Search Algorithm by Using a Double-Array Structure

IEEE Transactions on Software Engineering
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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 Trie Compaction Algorithm for a Large Set of Keys

IEEE Transactions on Knowledge and Data Engineering

Finding useful fuzzy concepts for pattern classification using genetic algorithm

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many information retrieval applications, it is necessary to be able to adopt a trie search for looking at the input character by character. As a fast and compact data structure for a trie, a double-array is presented. However, the insertion time is not faster than other dynamic retrieval methods because the double-array is a semi-static retrieval method that cannot treat high frequent updating. Further, the space efficiency of the double-array degrades with the number of deletions because it keeps empty elements produced by deletion. This paper presents a fast insertion algorithm by linking empty elements to find inserting positions quickly and a compression algorithm by reallocating empty elements for each deletion. From the simulation results for 100 thousands keys, it turned out that the insertion time and the space efficiency are achieved.