Managing Compressed Structured Text
Compressing XML; Searching compressed XML
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.
Modeling data using structured text has been a topic of interest at least since the 1980s, with a significant burst of activity in the 1990s . Since then, the widespread adoption of XML (appearing in 1998, see the current version at http://www.w3.org/TR/xml) as the standard to represent structured text has unified the efforts of the community around this particular format. Very early, however, the same...
- 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 the 26th International Conference on Data Engineering; 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
- 15.Navarro G, Ordóñez A. Faster compressed suffix trees for repetitive text collections. In: Proceedings of the 13th International Symposium on Experimental Algorithms; 2014. p. 424–35.Google Scholar
- 16.Navarro G, Ordóñez A. Grammar compressed sequences with rank/select support. In: Proceedings of the 21st International Symposium on String Processing and Information Retrieval; 2014.Google Scholar