AN EFFICIENT IMPLEMENTATION OF TRIE STRUCTURES

被引：60

作者：

AOE, JI ^{[1
]}

MORIMOTO, K ^{[1
]}

SATO, T ^{[1
]}

机构：

[1] OSAKA KYOIKU UNIV,DEPT ARTS & SCI,IKEDA 563,JAPAN

来源：

SOFTWARE-PRACTICE & EXPERIENCE | 1992年 / 22卷 / 09期

关键词：

DICTIONARY; INFORMATION RETRIEVAL; KEY RETRIEVAL STRATEGIES; NATURAL LANGUAGE PROCESSING;

D O I：

10.1002/spe.4380220902

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A new internal array structure, called a double-array, implementing a trie structure is presented. The double-array combines the fast access of a matrix form with the compactness of a list form. The algorithms for retrieval, insertion and deletion are introduced through examples. Although insertion is rather slow, it is still practical, and both the deletion and the retrieval time can be improved from the list form. From the comparison with the list for various large sets of keys, it is shown that the size of the double-array can be about 17 per cent smaller than that of the list, and that the retrieval speed of the double-array can be from 3.1 to 5.1 times faster than that of the list.

引用

页码：695 / 721

页数：27

共 50 条

[31] Implementation of PRINCE with resource-efficient structures based on FPGAs
Li, Lang
Feng, Jingya
Liu, Botao
Guo, Ying
Li, Qiuping
FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING, 2021, 22 (11) : 1505 - 1516
[32] A uniform approach to the analysis of Trie structures that store prefixing-keys
delaTorre, P
Kao, DT
JOURNAL OF ALGORITHMS, 1997, 22 (02) : 270 - 295
[33] Improved IP lookup technology for trie-based data structures
Lin, Yen-Heng
Hsieh, Sun-Yuan
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2023, 133 : 41 - 55
[34] On the Granularity of Trie-Based Data Structures for Name Lookups and Updates
Ghasemi, Chavoosh
Yousefi, Hamed
Shin, Kang G.
Zhang, Beichuan
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (02) : 777 - 789
[35] Leveraging deletion neighborhoods and trie for efficient string similarity search and join
Cui, Jia
Meng, Dan
Chen, Zhong-Tao
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8870
[36] Disk-resident High Utility Pattern Mining: A Trie Structure Implementation
Dwivedi, Vijay Kumar
PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS AND COMPUTER NETWORKS (ISCON), 2013, : 44 - 49
[37] Leveraging deletion neighborhoods and trie for efficient string similarity search and join
1600, Springer Verlag (8870):
[38] Efficient construction of pipelined multibit-trie router-tables
Kim, Kun Suk
Sahni, Sartaj
IEEE TRANSACTIONS ON COMPUTERS, 2007, 56 (01) : 32 - 43
[39] Leveraging Deletion Neighborhoods and Trie for Efficient String Similarity Search and Join
Cui, Jia
Meng, Dan
Chen, Zhong-Tao
INFORMATION RETRIEVAL TECHNOLOGY, AIRS 2014, 2014, 8870 : 1 - 13
[40] Optimizing Fuzzy Search in XML Using Efficient Trie Indexing Structure
Chandragandhi, S.
Nithya, L. M.
2013 INTERNATIONAL CONFERENCE ON RECENT TRENDS IN INFORMATION TECHNOLOGY (ICRTIT), 2013, : 496 - 501

← 1 2 3 4 5 →