LZ-Compressed String Dictionaries
Data Structures and Algorithms
2013-05-06 v1
Abstract
We show how to compress string dictionaries using the Lempel-Ziv (LZ78) data compression algorithm. Our approach is validated experimentally on dictionaries of up to 1.5 GB of uncompressed text. We achieve compression ratios often outperforming the existing alternatives, especially on dictionaries containing many repeated substrings. Our query times remain competitive.
Keywords
Cite
@article{arxiv.1305.0674,
title = {LZ-Compressed String Dictionaries},
author = {Julian Arz and Johannes Fischer},
journal= {arXiv preprint arXiv:1305.0674},
year = {2013}
}