A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.

DOI10.1016/S0306-4573(01)00031-0MaRDI QIDQ1395495zbMATH OpenOpenAlexFDO

Authors Masami Shishibori, Yasuhiro Tanaka, Min-Soo Jung, Jun-ichi Aoe

Publication date 1 July 2003

Published in Information Processing and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0306-4573(01)00031-0

zbMATH Keywords

Access methodData structureHierarchical structureInformation retrievalPatricia trie

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• Algorithms for trie compaction
• Patricia tries again revisited
• An Efficient Trie Construction for Natural Language Dictionaries
• An experimental study of compression methods for dynamic tries

Cited in

(1)

• Fast insertion methods of a double-array structure

This page was built for publication: A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395495)