An experimental study of compression methods for dynamic tries

DOI10.1007/S00453-001-0102-YzbMATH Open0994.68043OpenAlexW2048294592MaRDI QIDQ1600992FDOQ1600992

Authors: R. Smith 

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0102-y

Recommendations

• Improved behaviour of tries by adaptive branching
• Fast Compressed Tries through Path Decompositions
• Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
• Partial fillup and search time in LC tries
• Linked dynamic tries with applications to LZ-compression in sublinear time and space

zbMATH Keywords

data structure for binary data

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (8)

• A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.
• Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
• m-Bonsai: A Practical Compact Dynamic Trie
• Optimizing registration based encryption
• Smoothed heights of tries and patricia tries
• An Efficient Trie Construction for Natural Language Dictionaries
• Dynamic interpolation search revisited
• PTrie: data structure for compressing and storing sets via prefix sharing

This page was built for publication: An experimental study of compression methods for dynamic tries

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