Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1–8Cite as

Managing Compressed Structured Text

  • Living reference work entry
  • First Online:

  • 68 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution.

Recommended Reading

  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 

  3. Baeza-Yates R, Navarro G. Integrating contents and structure in text retrieval. ACM SIGMOD Rec. 1996;25(1):67–79.

    Article  Google Scholar 

  4. Barbay J, Claude F, Gagie T, Navarro G, Nekrich Y. Efficient fully-compressed sequence representations. Algorithmica. 2014;69(1):232–68.

    Article  MathSciNet  MATH  Google Scholar 

  5. Brisaboa NR, Fariña A, Navarro G, Paramá JR. Lightweight natural language text compression. Inf Retr. 2007;10(1):1–33.

    Article  Google Scholar 

  6. Brisaboa NR, Cerdeira-Pena A, Navarro G. XXS: efficient XPath evaluation on compressed XML documents. ACM Trans Inf Syst. 2014;32(3):13.

    Article  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 

  8. Ferragina P, Manzini G. Indexing compressed text. J ACM. 2005;52(4):552–81.

    Article  MathSciNet  MATH  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 

  10. Gottlob G, Koch C, Pichler R. Efficient algorithms for processing XPath queries. ACM Trans Database Syst. 2005;30(2):444–91.

    Article  Google Scholar 

  11. Lohrey M, Maneth S, Mennicke R. The complexity of tree automata and XPath on grammar-compressed trees. Theor Comput Sci. 2006;363(2):196–210.

    Article  MathSciNet  MATH  Google Scholar 

  12. Lohrey M, Maneth S, Mennicke R. XML tree structure compression using RePair. Inf Syst. 2013;38(8):1150–67.

    Article  Google Scholar 

  13. Mäkinen V, Navarro G, Sirén J, Välimäki N. Storage and retrieval of highly repetitive sequence collections. J Comput Biol. 2010;17(3):281–308.

    Article  MathSciNet  Google Scholar 

  14. Navarro G, Mäkinen V. Compressed full-text indexes. ACM Comput Surv. 2007;39(1):2.

    Article  MATH  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 

  17. Sakr S. XML compression techniques: a survey and comparison. J Comput Syst Sci. 2009;75(5):303–22.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Database Laboratory, Department of Computer Science, University of A Coruña, Campus de Elviña s/n, 15071, A Coruña, Spain

    Nieves R. Brisaboa & Ana Cerdeira-Pena

  2. Department of Computer Science, University of Chile, Blanco Encalada 2120, Santiago, Chile

    Gonzalo Navarro

Authors
  1. Nieves R. Brisaboa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ana Cerdeira-Pena
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nieves R. Brisaboa .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. University of Amsterdam, Amsterdam, The Netherlands

    Jaap Kamps

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media LLC

About this entry

Cite this entry

Brisaboa, N.R., Cerdeira-Pena, A., Navarro, G. (2017). Managing Compressed Structured Text. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_72-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_72-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4899-7993-3

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation