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 条

[41] m-Trie: An efficient approach to on-chip logic minimization
Ahmad, S
Mahapatra, R
ICCAD-2004: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2004, : 428 - 435
[42] On the implementation of memory reclamation methods in a lock-free hash trie design
Moreno, Pedro
Areias, Miguel
Rocha, Ricardo
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 155 : 1 - 13
[43] Two efficient structures for 2D digital filter implementation
Zhao, Z
IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2005, 152 (06): : 641 - 648
[44] Efficient Data Structures for Representation of Polynomial Optimization Problems: Implementation in SOSTOOLS
Jagt, Declan
Shivakumar, Sachin
Seiler, Peter
Peet, Matthew
IEEE CONTROL SYSTEMS LETTERS, 2022, 6 : 3493 - 3498
[45] Efficient implementation of fault-tolerant data structures in embedded systems
Embedded Systems Laboratory, University of Leicester, University Road, Leicester, United Kingdom
WSEAS Trans. Comput., 2007, 8 (1027-1035):
[46] Efficient implementation structures of AC-3's filter banks
Zhao, ZJ
ICSP '98: 1998 FOURTH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, PROCEEDINGS, VOLS I AND II, 1998, : 31 - 34
[47] Motif trie: An efficient text index for pattern discovery with don't cares
Grossi, Roberto
Menconi, Giulia
Pisanti, Nadia
Trani, Roberto
Vind, Soren
THEORETICAL COMPUTER SCIENCE, 2018, 710 : 74 - 87
[48] Efficient and scalable trie-based algorithms for computing set containment relations
Luo, Yongming
Fletcher, George H. L.
Hidders, Jan
De Bra, Paul
2015 IEEE 31ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2015, : 303 - 314
[49] Back to Patterns: Efficient Japanese Morphological Analysis with Feature-Sequence Trie
Yoshinaga, Naoki
61ST CONFERENCE OF THE THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, VOL 2, 2023, : 13 - 23
[50] An Efficient Query Scheme for Hybrid Storage Blockchains Based on Merkle Semantic Trie
Pei, Qingqi
Zhou, Enyuan
Xiao, Yang
Zhang, Deyu
Zhao, Dongxiao
2020 INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2020), 2020, : 51 - 60

← 1 2 3 4 5 →