Advertisement

Compression Algorithms for Structural Query Results on XML Data

  • Qing Wang
  • Hongzhi Wang
  • Hong Gao
  • Jianzhong Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6185)

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.

Keywords

Bitmap Structural query XML Compression Bit storage 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lu, Z.: A Survey Of XML Applications On Science And Technology. International Journal of Software Engineering and Knowledge Engineering (IJSEKE) 15(1), 1–33 (2005)CrossRefGoogle Scholar
  2. 2.
    Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Inf. Syst (IS) 16(4), 387–400 (1991)CrossRefGoogle Scholar
  3. 3.
    Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation. Prentice-Hall, Englewood Cliffs (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Qing Wang
    • 1
  • Hongzhi Wang
    • 1
  • Hong Gao
    • 1
  • Jianzhong Li
    • 1
  1. 1.Institute of Computer Science and TechnologyHarbin Institute of TechnologyHarbinChina

Personalised recommendations