Tree Compression with Top Trees
Data Structures and Algorithms
2014-05-13 v2
Abstract
We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.
Keywords
Cite
@article{arxiv.1304.5702,
title = {Tree Compression with Top Trees},
author = {Philip Bille and Inge Li Goertz and Gad M. Landau and Oren Weimann},
journal= {arXiv preprint arXiv:1304.5702},
year = {2014}
}
Comments
An extended abstract of this paper appeared at the 40th International Colloquium on Automata, Languages and Programming