Compression of Unordered XML Trees

Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Marc Herbstritt
2017 International Conference on Database Theory  
Many XML documents are data-centric and do not make use of the inherent document order. Can we provide stronger compression for such documents through giving up order? We first consider compression via minimal dags (directed acyclic graphs) and study the worst case ratio of the size of the ordered dag divided by the size of the unordered dag, where the worst case is taken for all trees of size n. We prove that this worst case ratio is n{ log n for the edge size and n log log n{ log n for the
more » ... e size. In experiments we compare several known compressors on the original document tree versus on a canonical version obtained by length-lexicographical sorting of subtrees. For some documents this difference is surprisingly large: reverse binary dags can be smaller by a factor of 3.7 and other compressors can be smaller by factors of up to 190. ACM Subject Classification E.4 Coding and Information Theory
doi:10.4230/lipics.icdt.2017.18 dblp:conf/icdt/LohreyMR17 fatcat:vqivzwc6gjfm5gsqyzwdvrph7a