A compact static double-array keeping character codes

被引:15
|
作者
Yata, Susumu [1 ]
Oono, Masaki [1 ]
Morita, Kazuhiro [1 ]
Fuketa, Masao [1 ]
Sumitomo, Toru [1 ]
Aoe, Jun-ichi [1 ]
机构
[1] Univ Tokushima, Fac Engn, Dept Informat Sci & Intelligent Syst, Tokushima 7708506, Japan
关键词
double-array; dictionary; compaction; TRIE STRUCTURES; ALGORITHM; SEARCH;
D O I
10.1016/j.ipm.2006.04.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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%. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:237 / 247
页数:11
相关论文
共 50 条
  • [21] Study for the Double-array Trie Tree Based Algorithm in Word Segmentation
    Yang, Wenchuan
    Fang, Zeyang
    Li, Pengfei
    INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENVIRONMENTAL ENGINEERING (CSEE 2015), 2015, : 440 - 446
  • [22] Compressed double-array tries for string dictionaries supporting fast lookup
    Shunsuke Kanda
    Kazuhiro Morita
    Masao Fuketa
    Knowledge and Information Systems, 2017, 51 : 1023 - 1042
  • [23] Design Optimization of Double-array Bolted Joints in Cylindrical Composite Structures
    Kim, Myungjun
    Kim, Yongha
    Kim, Pyeunghwa
    Park, Jungsun
    INTERNATIONAL JOURNAL OF AERONAUTICAL AND SPACE SCIENCES, 2016, 17 (03) : 332 - 340
  • [24] Double-Array Compression by Pruning Twin Leaves and Unifying Common Suffixes
    Yata, Susumu
    Oono, Masaki
    Morita, Kazuhiro
    Sumitomo, Toru
    Aoe, Jun-ichi
    2006 INTERNATIONAL CONFERENCE ON COMPUTING & INFORMATICS (ICOCI 2006), 2006, : 251 - +
  • [25] Compressed double-array tries for string dictionaries supporting fast lookup
    Kanda, Shunsuke
    Morita, Kazuhiro
    Fuketa, Masao
    KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 51 (03) : 1023 - 1042
  • [26] Hierarchically tailorable double-array film hybrids with enhanced photocatalytic and photoelectrochemical performances
    Zhang, Nan
    Quan, Quan
    Qi, Ming-Yu
    Tang, Zi-Rong
    Xu, Yi-Jun
    APPLIED CATALYSIS B-ENVIRONMENTAL, 2019, 259
  • [27] Simultaneous Pumping and Mixing of Biological Fluids in a Double-Array Electrothermal Microfluidic Device
    Salari, Alinaghi
    Dalton, Colin
    MICROMACHINES, 2019, 10 (02)
  • [28] Limit theorems for continuous-time random walks in the double-array limit scheme
    Bening V.E.
    Korolev V.Yu.
    Kolokoltsov V.N.
    Journal of Mathematical Sciences, 2006, 138 (1) : 5348 - 5365
  • [29] THEORETICAL CHARACTERISTICS OF DOUBLE-ARRAY AND TRIPLE-ARRAY ELECTRIC CURTAINS OF STANDING-WAVE TYPE
    AOYAMA, M
    MASUDA, S
    ELECTRICAL ENGINEERING IN JAPAN, 1975, 95 (06) : 20 - 27
  • [30] An improvement key deletion method for double-array structure using single-nodes
    Oono, M
    Fuketa, M
    Morita, K
    Kashiji, S
    Aoe, J
    INFORMATION PROCESSING & MANAGEMENT, 2004, 40 (01) : 47 - 63