Compression of unordered XML trees

DOI10.4230/LIPICS.ICDT.2017.18MaRDI QIDQ3174911zbMATH OpenOpenAlexFDO

Authors Markus Lohrey, Sebastian Maneth, Carl Philipp Reh

Publication date 18 July 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.ICDT.2017.18

zbMATH Keywords

directed acyclic graphstree compressionXML

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• XML compression via directed acyclic graphs
• An effective grammar-based compression algorithm for tree structured data.
• Database Programming Languages
• Tight bounds for top tree compression
• Compressing and indexing labeled trees, with applications

Cited in

(7)

• Distinct fringe subtrees in random trees
• XML compression via directed acyclic graphs
• scientific article; zbMATH DE number 1865432 (Why is no real title available?)
• A type system for interactive JSON schema inference (extended abstract)
• Comparison of XML compression techniques
• Database Programming Languages
• Fuzzy similarity and proximity constraint solving in theories with unordered symbols

This page was built for publication: Compression of unordered XML trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174911)