2016 IEEE 32nd International Conference on Data Engineering (ICDE) (2016)
May 16, 2016 to May 20, 2016
Stefan Bottcher , University of Paderborn, Fürstenallee 11, 33102, Germany
Rita Hartel , University of Paderborn, Fürstenallee 11, 33102, Germany
Thomas Jacobs , University of Paderborn, Fürstenallee 11, 33102, Germany
Sebastian Maneth , University of Edinburgh, Informatics Forum, Crichton Street, EH8 9AB, UK
XML tree structures can be effectively compressed using straight-line grammars. It has been an open problem how to update straight-line grammars, while keeping them compressed. Therefore, the best previous known methods resort to periodic decompression followed by compression from scratch. The decompression step is expensive, potentially with exponential running time. We present a method that avoids this expensive step. Our method recompresses the updated grammar directly, without prior decompression; it thus greatly outperforms the decompress-compress approach, in terms of both space and time. Our experiments show that the obtained grammars are similar or even smaller than those of the decompress-compress method.
Grammar, XML, Ad hoc networks, Mobile computing, Maintenance engineering, Binary trees, Jacobian matrices
S. Bottcher, R. Hartel, T. Jacobs and S. Maneth, "Incremental updates on compressed XML," 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki, Finland, 2016, pp. 1026-1037.