2011 Data Compression Conference (DCC) (2011)
March 29, 2011 to March 31, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2011.42
Larsson and Moffat's RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which are smaller than those produced by previous grammar-based compressors such as BPLEX. Experiments show that a Huffman-based coding of the resulting grammars gives compression ratios comparable to the best known XML file compressors. Moreover, SLT grammars can be used as efficient memory representation of trees. Our investigations show that tree traversals over TreeRePair grammars are 14 times slower than over pointer structures and 5 times slower than over succinct trees, while memory consumption is only 1/43 and 1/6, respectively.
context-free grammars, data compression, Huffman codes, tree data structures
M. Lohrey, S. Maneth and R. Mennicke, "Tree Structure Compression with RePair," 2011 Data Compression Conference (DCC), Snowbird, UT, 2011, pp. 353-362.