Managing Compressed Structured Text
Compressing structured text is the problem of creating a reduced-space representation from which the original data can be re-created exactly. Compared to plain text compression, the goal is to take advantage of the structural properties of the data. A more ambitious goal is that of being able of manipulating this text in compressed form, without decompressing it. This entry focuses on compressing, navigating, and searching structured text, as those are the areas where more advances have been made.
- 1.Arroyuelo D, Cánovas R, Navarro G, Sadakane K. Succinct trees in practice. In: Proceedings of 11th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM Press; 2010. p. 84–97.Google Scholar
- 2.Arroyuelo D, Claude F, Maneth S, Mäkinen V, Navarro G, Nguyen K, Sirén J, Välimäki N. Fast in-memory XPath search using compressed indexes. In: Proceedings of 26th IEEE International Conference on Data Engineering (ICDE); 2010. p. 417–28.Google Scholar
- 7.Cerdeira-Pena A. Compressed self-indexed XML representation with efficient XPath evaluation. PhD thesis, Department of Computer Science, University of A Coruña, 2013.Google Scholar
- 9.Ferragina P, Luccio F, Manzini G, Muthukrishnan S. Compressing and indexing labeled trees, with applications. J ACM. 2009;57(1):4:1–4:33.Google Scholar
- 15.Navarro G, Ordóñez A. Faster compressed suffix trees for repetitive text collections. In: Proceedings of 13th International Symposium on Experimental Algorithms (SEA). LNCS 8504; 2014. p. 424–35.Google Scholar
- 16.Navarro G, Ordóñez A. Grammar compressed sequences with rank/select support. In: Proceedings of 21st International Symposium on String Processing and Information Retrieval (SPIRE); (2014, to appear).Google Scholar