Abstract
XML is an important data form. The size of query results on XML data is very large in some applications and in the distributed XML data management system, the transmission of query results become the bottleneck. For the efficiency of XML management system, the compression method for XML query results is studied in this paper. By exploiting the properties of query results on XML data, two compression methods are proposed. One is a G-bitmap algorithm as a variant of bitmap index. The other is based on tree structure. The experiments on real and manual data demonstrate the effectiveness and efficiency of our compression methods. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Wang, Q., Wang, H., Gao, H., & Li, J. (2010). Compression algorithms for structural query results on XML data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6185 LNCS, pp. 141–145). https://doi.org/10.1007/978-3-642-16720-1_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
