Compacting XML Data

  • Shuohao Zhang
  • Curtis Dyreson
  • Zhe Dang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)


Compression aims to reduce the size of data without loss of information. Compaction is a special kind of compression in which the output is in the same language as the input. Compaction of an XML data forest produces a smaller XML forest, without losing any data. This paper develops a formal framework for the compaction of XML data and presents two compaction techniques.


Target Signature Compression Technique Huffman Code Related Node Document Object Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Huffman, D.: A Method for Construction of Minimum-Redundancy Codes. In: Proc. of IRE (September 1952)Google Scholar
  2. 2.
    Liefke, H., Suciu, D.: Xmill: An Efficient Compressor for XML Data. In: SIGMOD Conference (2000)Google Scholar
  3. 3.
    Min, J., Park, M., Chung, C.: XPRESS: A Queriable Compression for XML Data. In: SIGMOD Conference (2003)Google Scholar
  4. 4.
    Tolani, P.M., Haritsa, J.R.: XGRIND: A Query-friendly XML Compressor. In: ICDE (2002)Google Scholar
  5. 5.
    W3C. Document Object Model (DOM),
  6. 6.
    Welch, T.: A Technique for High-Performance Data Compression, Computer, pp. 8–18 (1984)Google Scholar
  7. 7.
    Ziv, J., Lempel, A.: A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 23(3), 337–343 (1977)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shuohao Zhang
    • 1
  • Curtis Dyreson
    • 1
  • Zhe Dang
    • 1
  1. 1.P. O. Box 642752Washington State UniversityPullmanUSA

Personalised recommendations