An improvement key deletion method for double-array structure using single-nodes

被引：2
|
作者：
Oono, M [1 ]
Fuketa, M [1 ]
Morita, K [1 ]
Kashiji, S [1 ]
Aoe, J [1 ]
机构：
[1] Univ Tokushima, Fac Engn, Dept Informat Sci & Intelligent Syst, Tokushima 7708506, Japan
来源：
INFORMATION PROCESSING & MANAGEMENT | 2004年 / 40卷 / 01期
关键词：
dictionary; information retrieval; trie search; double-array structure; natural language processing;
D O I：
10.1016/S0306-4573(02)00090-0
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A trie is a well known method for various dictionaries, such as spelling check and morphological analysis. A double-array structure is an efficient data structure combining fast access of a matrix form with the compactness of a list form. The drawback of the double-array is that the space efficiency degrades by empty elements produced in key deletion. Morita presented a key deletion method eliminating empty elements. However, the space efficiency of this method is low for high frequent deletion and deletion takes much time because the cost depends on the number of the empty elements. This paper presents a fast and compact deletion method by using the property of nodes that have no brothers. From simulation results for 100,000 keys, the present method is about 330 times faster than Morita's method and keeps high space efficiency. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码：47 / 63
页数：17
相关论文
共 50 条
  • [1] An efficient key updating algorithm for double-array structure
    Oono, M
    Kadaya, K
    Fuketa, M
    Oda, M
    Harada, J
    Aoe, J
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XII, PROCEEDINGS: INFORMATION SYSTEMS, TECHNOLOGIES AND APPLICATIONS: II, 2003, : 311 - 313
  • [2] Fast insertion methods of a double-array structure
    Morita, Kazuhiro
    Fuketa, Masao
    Yamakawa, Yoshihiro
    Aoe, Jun-Ichi
    Software - Practice and Experience, 2001, 31 (01) : 43 - 65
  • [3] A compression method of double-array structures using linear functions
    Kanda, Shunsuke
    Fuketa, Masao
    Morita, Kazuhiro
    Aoe, Jun-ichi
    KNOWLEDGE AND INFORMATION SYSTEMS, 2016, 48 (01) : 55 - 80
  • [4] Fast insertion methods of a double-array structure
    Morita, K
    Fuketa, M
    Yamakawa, Y
    Aoe, J
    SOFTWARE-PRACTICE & EXPERIENCE, 2001, 31 (01): : 43 - 65
  • [5] AN EFFICIENT DIGITAL SEARCH ALGORITHM BY USING A DOUBLE-ARRAY STRUCTURE
    AOE, JI
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (09) : 1066 - 1077
  • [6] A compression method of double-array structures using linear functions
    Shunsuke Kanda
    Masao Fuketa
    Kazuhiro Morita
    Jun-ichi Aoe
    Knowledge and Information Systems, 2016, 48 : 55 - 80
  • [7] Implementation of update algorithms for a double-array structure
    Morita, K
    Tanaka, A
    Fuketa, M
    Aoe, J
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 494 - 499
  • [8] A fast and compact elimination method of empty elements from a double-array structure
    Oono, M
    Atlam, ES
    Fuketa, M
    Morita, K
    Aoe, J
    SOFTWARE-PRACTICE & EXPERIENCE, 2003, 33 (13): : 1229 - 1249
  • [9] Fast and compact updating algorithms of a double-array structure
    Morita, K
    Atlam, ES
    Fuketa, M
    Tsuda, K
    Aoe, J
    INFORMATION SCIENCES, 2004, 159 (1-2) : 53 - 67
  • [10] Proposal of search method compressed the one-way branch hased on the double-array structure
    Nakamura, Yasumasa
    Mochizuki, Hisatoshi
    PROCEEDINGS OF THE 6TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED COMPUTER SCIENCE, 2007, : 472 - +
12345