A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure

Information Processing and Management

Volumn 38, Issue 2, 2002, Pages 221-236

  Jung, Minsoo ^a   Shishibori, Masami ^a   Tanaka, Yasuhiro ^a   Aoe, Jun ichi ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

Access method; Data structure; Hierarchical structure; Information retrieval; Patricia trie

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; HIERARCHICAL SYSTEMS; TREES (MATHEMATICS);

DATA ACCESS METHODS;

INFORMATION RETRIEVAL;

EID: 0036497403     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4573(01)00031-0     Document Type: Article

References (13)

1. An efficient digital search algorithm by using a double-array structure
2. A trie compaction algorithm for a large set of keys
3. Complete inverted files for efficient text retrieval and analysis
4. Searching algorithms
5. New indices for text: Pat trees and Pat arrays
6. Two access methods using compact binary trees
7. Trie hashing with controlled load
8. PATRICIA: Practical algorithm to retrieve information coded in alpha-numeric
9. Coding grams of variable length into fixed bytes for fast full text retrieval with compact indices
10. An algorithm for string matching with a sequence of don't cares
11. Suffix arrays: A new method for on-line string searches