paper.pdf (454.04 kB)
Download file

Tree Compression with Top Trees Revisited

Download (454.04 kB)
conference contribution
posted on 07.05.2015, 10:28 by L. Hübschle-Schneider, Rajeev Raman
We revisit tree compression with top trees (Bille et al. Information & Computation 2015), and present several improvements to the compressor and its analysis. By significantly reducing the amount of information stored and guiding the compression step using a RePair-inspired heuristic, we obtain a fast compressor achieving good compression ratios, addressing an open problem posed by Bille et al. We show how, with relatively small overhead, the compressed file can be converted into an in-memory representation that supports basic navigation operations in worst-case logarithmic time without decompression. We also show a much improved worst-case bound on the size of the output of top-tree compression (answering an open question posed in a talk on this algorithm by Weimann in 2012).

History

Citation

Lecture Notes in Computer Science, 2015, pp. 15-27 (12)

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

14th International Symposium on Experimental Algorithms (SEA 2015) SEA 2015, Paris, France

Version

AM (Accepted Manuscript)

Published in

Lecture Notes in Computer Science

Publisher

Springer Verlag (Germany)

issn

0302-9743

isbn

978-3-319-20085-9;978-3-319-20086-6

Copyright date

1007

Available date

20/06/2016

Publisher version

http://link.springer.com/chapter/10.1007/978-3-319-20086-6_2

Temporal coverage: start date

29/06/2015

Temporal coverage: end date

01/07/2015

Language

en

Usage metrics

Categories

Exports