|
Title |
Engineering Practical Lempel-Ziv Tries |
|
Authors |
Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Koppl, Martin Löbel, Gonzalo Navarro, Rajeev Raman |
|
Publication date |
2021 |
|
Abstract |
The Lempel-Ziv 78 (LZ78) and Lempel-Ziv-Welch (LZW) text factorizations are popular, not only for bare compression but also for building compressed data structures on top of them. Their regular factor structure makes them computable within space bounded by the compressed output size. In this article, we carry out the first thorough study of low-memory LZ78 and LZW text factorization algorithms, introducing more efficient alternatives to the classical methods, as well as new techniques that can run within less memory space than the necessary to hold the compressed file. Our results build on hash-based representations of tries that may have independent interest. |
|
Downloaded |
4 times |
|
Pages |
article 14 |
|
Volume |
26 |
|
Journal name |
ACM Journal of Experimental Algorithmics |
|
Publisher |
ACM Press (New York, NY, USA) |
|
PDF |
|
|
Reference URL |
|
