Double-Array Compression by Pruning Twin Leaves and Unifying Common Suffixes

被引：0

作者：

Yata, Susumu ^{[1
]}

Oono, Masaki ^{[1
]}

Morita, Kazuhiro ^{[1
]}

Sumitomo, Toru ^{[1
]}

Aoe, Jun-ichi ^{[1
]}

机构：

[1] Univ Tokushima, Fac Engn, Dept Informat Sci & Intelligent Syst, Tokushima, Japan

来源：

2006 INTERNATIONAL CONFERENCE ON COMPUTING & INFORMATICS (ICOCI 2006) | 2006年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A Minimal Prefix (MP) trie is a tree structure for key retrieval, and a double-array is an efficient data structure for the MP trie. This paper presents two compression methods for the double-array. One method removes leaf nodes following two-way arcs (named twin leaves) from the MP trie. The other method unifies common suffixes. Experimental results show that space usage of the double-array is reduced to about 60% by the two methods.

引用

页码：251 / +

页数：2

共 3 条

[1] A compression method of double-array structures using linear functions
Kanda, Shunsuke
Fuketa, Masao
Morita, Kazuhiro
Aoe, Jun-ichi
[J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2016, 48 (01) : 55 - 80
[2] A compression method of double-array structures using linear functions
Shunsuke Kanda
Masao Fuketa
Kazuhiro Morita
Jun-ichi Aoe
[J]. Knowledge and Information Systems, 2016, 48 : 55 - 80
[3] New methods for compression of MP double array by compact management of suffixes
Dorji, Tshering C.
Atlam, El-sayed
Yata, Susumu
Rokaya, Mahmoud
Fuketa, Masao
Morita, Kazuhiro
Aoe, Jun-ichi
[J]. INFORMATION PROCESSING & MANAGEMENT, 2010, 46 (05) : 502 - 513

← 1 →