Fast multi-update operations on compressed XML data

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Grammar-based XML compression reduces the volume of big XML data collections, but fast updates of compressed data may become a bottleneck. An open question still was, given an XPath Query and an update operation, how to efficiently compute the update positions within a grammar representing a compressed XML file. In this paper, we propose an automaton-based solution, which computes these positions, combines them in a so-called Update DAG, supports parallel updates, and uses dynamic programming to avoid an implicit decompression of the grammar. As a result, our solution updates compressed XML even faster than MXQuery and Qizx update uncompressed XML. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Böttcher, S., Hartel, R., & Jacobs, T. (2013). Fast multi-update operations on compressed XML data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7968 LNCS, pp. 149–164). https://doi.org/10.1007/978-3-642-39467-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free