Algorithms for trie compaction

DOI10.1145/329.295zbMath0542.68079OpenAlexW2002320078MaRDI QIDQ3330555

No author found.

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

algorithmstrie data structurestorage retrievaltrie compaction

Mathematics Subject Classification ID

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

Related Items (4)

Partition search for non-binary constraint satisfaction ⋮ An Efficient Trie Construction for Natural Language Dictionaries ⋮ How to squeeze a lexicon ⋮ A link trie structure of storing multiple attribute relationships for natural language dictionaries

This page was built for publication: Algorithms for trie compaction