DTD-Driven Structure Preserving XML Compression

  • Stefan Böttcher
  • Rita Steinmetz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4042)


Whenever XML is used as the data format to exchange large amounts of data or even for data streams, the verbose behavior of XML is one of the bottle necks. While compression of XML data seems to be a way out, it is essential for a variety of applications that the compression result still can be parsed, searched, transformed or modified efficiently. In order to support efficient search in compressed XML data, we have devel oped a compression technique that links two components: the first component uses the DTD to perform a structure-preserving compression of XML markup data, while the second uses a trie for the compression of text constants and attribute values.


Data Stream Compression Algorithm Compression Technique Path Query XPath Query 
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.
    Arion, A., Bonifati, A., Costa, G., D’Aguanno, S., Manolescu, I., Pugliese, A.: XQueC: Pushing queries to compressed XML data. In: Proc. VLDB, pp. 1065–1068 (2003)Google Scholar
  2. 2.
    Buneman, P., Grohe, M., Koch, C.: Path Queries on Compressed XML. In: VLDB 2003, pp. 141–152 (2003)Google Scholar
  3. 3.
    Busatto, G., Lohrey, M., Maneth, S.: Efficient Memory Representation of XML Dokuments. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 199–216. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Cheng, J., Ng, W.: XQzip: Querying Compressed XML Using Structural Indexing. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 219–236. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Fredkin, E.: Trie Memory. Communications of the ACM 3(9), 490–499 (1960)CrossRefGoogle Scholar
  6. 6.
    Huffman, D.: A Method for Construction of Minimum-Redundancy Codes. In: Proc. of IRE (September 1952)Google Scholar
  7. 7.
    Liefke, H., Suciu, D.: XMill: An Efficient Compressor for XML Data. In: Proc. of ACM SIGMOD (May 2000)Google Scholar
  8. 8.
    Min, J.K., Park, M.J., Chung, C.W.: XPRESS: A Queriable Compression for XML Data. In: Proceedings of SIGMOD (2003)Google Scholar
  9. 9.
    Sundaresan, N., Moussa, R.: Algorithms and programming models for efficient representation of XML for Internet applications WWW (2001)Google Scholar
  10. 10.
    Tolani, P.M., Hartisa, J.R.: XGRIND: A query-friendly XML compressor. In: Proc. ICDE 2002, pp. 225–234. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Stefan Böttcher
    • 1
  • Rita Steinmetz
    • 1
  1. 1.University of Paderborn, Computer SciencePaderbornGermany

Personalised recommendations