Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Huffman, D.: A Method for Construction of Minimum-Redundancy Codes. In: Proc. of IRE (September 1952)
Liefke, H., Suciu, D.: Xmill: An Efficient Compressor for XML Data. In: SIGMOD Conference (2000)
Min, J., Park, M., Chung, C.: XPRESS: A Queriable Compression for XML Data. In: SIGMOD Conference (2003)
Tolani, P.M., Haritsa, J.R.: XGRIND: A Query-friendly XML Compressor. In: ICDE (2002)
W3C. Document Object Model (DOM), http://www.w3.org/DOM
Welch, T.: A Technique for High-Performance Data Compression, Computer, pp. 8–18 (1984)
Ziv, J., Lempel, A.: A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 23(3), 337–343 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, S., Dyreson, C., Dang, Z. (2006). Compacting XML Data. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_54
Download citation
DOI: https://doi.org/10.1007/11733836_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33337-1
Online ISBN: 978-3-540-33338-8
eBook Packages: Computer ScienceComputer Science (R0)