Algorithms for trie compaction

DOI10.1145/329.295MaRDI QIDQ3330555zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/329.295

zbMATH Keywords

algorithmsstorage retrievaltrie compactiontrie data structure

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 4775
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• An Efficient Trie Construction for Natural Language Dictionaries
• Improved behaviour of tries by adaptive branching
• A unifying framework for trie design heuristics

Cited in

(15)

• A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.
• Partition search for non-binary constraint satisfaction
• How to squeeze a lexicon
• scientific article; zbMATH DE number 2127731 (Why is no real title available?)
• Variable-depth trie index optimization: theory and experimental results
• An Efficient Trie Construction for Natural Language Dictionaries
• scientific article; zbMATH DE number 4775 (Why is no real title available?)
• A link trie structure of storing multiple attribute relationships for natural language dictionaries
• Computing runs on a trie
• Combinatorial Pattern Matching
• m-Bonsai: a practical compact dynamic trie
• Trie: An alternative data structure for data mining algorithms
• New trie data structures which support very fast search operations
• A pruned TRIE to index a sorted file and its evaluation
• A unifying framework for trie design heuristics

This page was built for publication: Algorithms for trie compaction

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