A compact static double-array keeping character codes

Authors:
Susumu Yata;Masaki Oono;Kazuhiro Morita;Masao Fuketa;Toru Sumitomo;Jun-ichi Aoe
Affiliations:
Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Tokushima, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Tokushima, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Tokushima, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Tokushima, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Tokushima, Japan;Department of Information Science and Intelligent Systems, Faculty of Engineering, University of Tokushima, Tokushima, Japan
Venue:
Information Processing and Management: an International Journal
Year:
2007

Citing 15
Cited 3

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
Implementing dynamic minimal-prefix tries

Software—Practice & Experience
An efficient implementation of trie structures

Software—Practice & Experience
A method of compressing trie structures

Software—Practice & Experience
A prefix trie index for inverted files

Information Processing and Management: an International Journal
A fast retrieving algorithm of hierarchical relationships using trie structures

Information Processing and Management: an International Journal
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 Structures and Algorithms

Data Structures and Algorithms
Using Tries to Eliminate Pattern Collisions in Perfect Hashing

IEEE Transactions on Knowledge and Data Engineering
A Trie Compaction Algorithm for a Large Set of Keys

IEEE Transactions on Knowledge and Data Engineering
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure

Information Processing and Management: an International Journal

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
A GPU-Based accelerator for chinese word segmentation

APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

A trie represented by a double-array enables us to search a key fast with a small space. However, the double-array uses extra space to be updated dynamically. This paper presents a compact structure for a static double-array. The new structure keeps character codes instead of indices in order to compress elements of the double-array. In addition, the new structure unifies common suffixes and consists of less elements than the old structure. Experimental results for English keys show that the new structure reduces space usage of the double-array up to 40%.