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 条

[21] An Efficient IP Address Lookup Algorithm Using a Priority Trie
Lim, Hyesook
Mun, Ju Hyoung
GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
[22] Efficient peer-to-peer lookup based on a distributed trie
Freedman, MJ
Vingralek, R
PEER-TO-PEER SYSTEMS, 2002, 2429 : 66 - 75
[23] Fast retrieving algorithm of hierarchical relationships using trie structures
Univ of Tokushima, Tokushima-Shi, Japan
Inf Process Manage, 6 (761-773):
[24] Dynamical Sources in Information Theory: A General Analysis of Trie Structures
Clément, J.
Flajolet, P.
Vallée, B.
Algorithmica (New York), 2001, 29 (1-2): : 307 - 369
[25] Dynamical sources in information theory: A general analysis of trie structures
J. Clément
P. Flajolet
B. Vallée
Algorithmica, 2001, 29 : 307 - 369
[26] Modified LC-Trie based efficient routing lookup
Ravikumar, VC
Mahapatra, R
Liu, JC
MASCOTS 2002: 10TH IEEE INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATIONS SYSTEMS, PROCEEDINGS, 2002, : 177 - 182
[27] Index-Trie: Efficient archival and retrieval of network traffic
Xie, Gaogang
Su, Jingxiu
Wang, Xin
He, Taihua
Zhang, Guangxing
Uhlig, Steve
Salamatian, Kave
COMPUTER NETWORKS, 2017, 124 : 140 - 156
[28] A fast retrieving algorithm of hierarchical relationships using trie structures
Koyama, M
Morita, K
Fuketa, M
Aoe, JI
INFORMATION PROCESSING & MANAGEMENT, 1998, 34 (06) : 761 - 773
[29] An analytic approach to the asymptotic variance of trie statistics and related structures
Fuchs, Michael
Hwang, Hsien-Kuei
Zacharovas, Vytas
THEORETICAL COMPUTER SCIENCE, 2014, 527 : 1 - 36
[30] Dynamical sources in information theory:: A general analysis of trie structures
Clément, J
Flajolet, P
Vallée, B
ALGORITHMICA, 2001, 29 (1-2) : 307 - 369

← 1 2 3 4 5 →