Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
Johannes Fischer, Dominik K\"oppl
TL;DR
This paper provides a comprehensive practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch algorithms using trie data structures, demonstrating that optimized trie representations can outperform existing popular implementations.
Contribution
It introduces optimized trie representations for LZ78 and LZW algorithms, achieving better performance than well-established trie data structures.
Findings
Optimized trie representations outperform Judy, m-Bonsai, and Cedar.
Thorough practical study of LZ78 and LZW with trie data structures.
First comprehensive practical evaluation of these algorithms using tries.
Abstract
We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m-Bonsai or Cedar.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Combinatorial Mathematics · Cellular Automata and Applications