Abstract
We introduce a new compression scheme for labeled trees based on top trees [3]. 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.
A draft of the full version of the paper can be found as Arxiv preprint arXiv:1304.5702.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adiego, J., Navarro, G., de la Fuente, P.: Lempel-Ziv compression of highly structured documents. J. Amer. Soc. Inf. Sci. and Techn. 58(4), 461–478 (2007)
Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 270–280. Springer, Heidelberg (1997)
Alstrup, S., Holm, J., Lichtenberg, K.D., Thorup, M.: Maintaining information in fully-dynamic trees with top trees. ACM Trans. Algorithms 1, 243–264 (2003)
Alstrup, S., Holm, J., Thorup, M.: Maintaining center and median in dynamic trees. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 46–56. Springer, Heidelberg (2000)
Benoit, D., Demaine, E., Munro, I., Raman, R., Raman, V., Rao, S.: Representing trees of higher degree. Algorithmica 43, 275–292 (2005)
Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Arxiv preprint arXiv:1304.5702 (2013)
Bille, P., Landau, G., Raman, R., Rao, S., Sadakane, K., Weimann, O.: Random access to grammar-compressed strings. In: Proc. 22nd SODA, pp. 373–389 (2011)
Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Proc. 29th VLDB, pp. 141–152 (2003)
Busatto, G., Lohrey, M., Maneth, S.: Grammar-based tree compression. Technical report, EPFL (2004)
Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Information Systems 33(4-5), 456–474 (2008)
Charikar, M., Lehman, E., Lehman, A., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inform. Theory 51(7), 2554–2576 (2005)
Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM 27, 758–771 (1980)
Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57, 1–33 (2009)
Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: Proc. 18th LICS, pp. 188–197 (2003)
Geary, R., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proc. 15th SODA, pp. 1–10 (2004)
Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549–554 (1989)
Lohrey, M., Maneth, S.: The complexity of tree automata and XPath on grammar-compressed trees. Theoret. Comput. Sci. 363(2) (2006)
Lohrey, M., Maneth, S., Mennicke, R.: Tree structure compression with repair. Arxiv preprint arXiv:1007.5406 (2010)
Maneth, S., Busatto, G.: Tree transducers and tree compressions. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 363–377. Springer, Heidelberg (2004)
Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762–776 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bille, P., Gørtz, I.L., Landau, G.M., Weimann, O. (2013). Tree Compression with Top Trees. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)