Article

Free access

XMill: an efficient compressor for XML data

Authors:

Hartmut Liefke,

Dan SuciuAuthors Info & Claims

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

Pages 153 - 164

https://doi.org/10.1145/342009.335405

Published: 16 May 2000 Publication History

Abstract

We describe a tool for compressing XML data, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip at roughly the same speed. The compressor, called XMill, incorporates and combines existing compressors in order to apply them to heterogeneous XML data: it uses zlib, the library function for gzip, a collection of datatype specific compressors for simple data types, and, possibly, user defined compressors for application specific data types.

References

[1]

D. Belanger and K. Church. Data flows with examples from telecommunications. In Proceedings of 1999 Workshop on Databases in Telecommunication, Edinburgh, UK, September 1999.

[2]

T.C. Bell, J.G. Cleary, and I.H. Witten. Text Compression. Prentice Hall, Englewood Cliffs, New Jersey, 1990.

Digital Library

[3]

M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, May 1994.

[4]

Clark and S. DeRose. XML path language (XPath), version 1.0. W3C Working Draft, August 1999. Available as http ://www. w3. org/TR/xpath.

[5]

R. Goldman and J. Widom. DataGuides: enabling query formulation and optimization in semistructured databases. In Proceedings of the International Conference on Very Large Data Bases, pages 436-445, Athens, Greece, August 1997.

Digital Library

[6]

J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. In Proc. IEEE Conf on Data Engineering, 1998.

Digital Library

[7]

S. Grumbach and F. Tahi. A new challenge for compression algorithms: genetic sequences. Information Processing and Management, 30(6):875-886, 1994.

Digital Library

[8]

D. G. Higgins, R. Fuchs, P. J. Stoehr, and G. N. Cameron. The EMBL data library. Nucleic Acids Research, 20:2071- 2074, 1992.

[9]

J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 1979.

Digital Library

[10]

B.R. Iyer and D. Wilhite. Data compression support in databases. In VLDB'9#, Proceedings of 20th International Conference on Very Large Data Bases, pages 695-704, Santiago de Chile, Chile, September 1994.

Digital Library

[11]

H. Liefke and S.B. Davidson. An extensible compressor for XML data. SIGMOD Record, 29(1), March 2000.

Digital Library

[12]

H. Liefke and D. Suciu. XMill: An efficient compressor for XML data. Technical Report MS-CIS-98-06, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104, October 1999.

[13]

M.P. Marcus, B. Santorini, and M. Marcinkiewicz. Building a large annotated corpus of english: the penn treebank. Computational Linguistics, 19, 1993.

Digital Library

[14]

S. Nestorov, S. Abiteboul, and R. Motwani. Inferring structure in semistructured data. In Proceedings of the Workshop on Management of Semi-structured Data, 1997. Available from http ://www. research, att. com/~ suc iu/workshop-papers, html.

Digital Library

[15]

W.K. Ng and C.V. Ravishankar. Block-oriented compression techniques for large statistical databases. TKDE, 9(2):314- 328, 1997.

Digital Library

[16]

M. A. Roth and S. Van Horn. Database compression. ACM SIGMOD Record, 22(3):31-39, Sept. 1993.

Digital Library

[17]

D. Salomon. Data Compression. The Complete Reference. Springer, New York, 1997.

Digital Library

[18]

C.E. Shannon. A mathematica theory of communication. Bell System Technical Journal, 27:379-423 and 623-656, July and October 1948. Also available in Claude Elwood Shannon, Collected Papers, N.J.A.Sloane and A.D.Wyner eds, IEEE Press, 1993.

Digital Library

[19]

H.S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. XML schema part 1: Structures. 1/113C Working Draft, September 1999. Available as http://www, w3. org/TR/xmls chema-I.

[20]

J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.

Digital Library

Cited By

Tiwary GStroulia ESrivastava A(2021)Compression of XML and JSON API ResponsesIEEE Access10.1109/ACCESS.2021.30730419(57426-57439)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3073041
Alkowaileet WAlsubaiee SCarey M(2020)An LSM-based tuple compaction framework for Apache AsterixDBProceedings of the VLDB Endowment10.14778/3397230.339723613:9(1388-1400)Online publication date: 26-Jun-2020
https://dl.acm.org/doi/10.14778/3397230.3397236
Siew CKumar P(2019)CitySAC: A Query-Able CityGML Compression SystemSmart Cities10.3390/smartcities20100082:1(106-117)Online publication date: 19-Mar-2019
https://doi.org/10.3390/smartcities2010008
Show More Cited By

Index Terms

XMill: an efficient compressor for XML data
1. Information systems

Recommendations

XMill: an efficient compressor for XML data

We describe a tool for compressing XML data, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip at roughly the same speed. The compressor, called XMill, incorporates and combines existing ...
Rate conversion of MPEG coded video by re-quantization process
ICIP '95: Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3

We propose rate conversion method by re-quantization in which MPEG coded video at high bit rate is converted into the MPEG bitstream at a lower bit rate without decoding to obtain the reconstructed picture. The quantization step required for re-...
New CAVLC design for lossless intra coding
ICIP'09: Proceedings of the 16th IEEE international conference on Image processing

The context-based adaptive variable length coder (CAVLC) in H.264/AVC is not appropriate for lossless video coding because it was designed for lossy video coding. Since statistical characteristics of residual data in lossy and lossless coding are quite ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

May 2000

604 pages

ISBN:1581132174

DOI:10.1145/342009

Chairmen:
Maggie Dunham
Southern Methodist Univ.
,
Jeffrey F. Naughton
Univ. of Wisconsin-Madison
,
Weidong Chen
Southern Methodist Univ.
,
Nick Koudas
AT &T Labs

ACM SIGMOD Record Volume 29, Issue 2
June 2000
609 pages
ISSN:0163-5808
DOI:10.1145/335191
Editors:
Weidong Chen
Southern Methodist Univ., Dallas, TX
,
Jeffrey Naughton
Univ. of Wisconsin-Madison, Madison
,
Philip A. Bernstein
Microsoft
Issue’s Table of Contents

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS00

Sponsor:

SIGMOD

SIGMOD/PODS00: ACM International Conference on Management of Data and Symposium on Principles of Database Systems

May 15 - 18, 2000

Texas, Dallas, USA

Acceptance Rates

SIGMOD '00 Paper Acceptance Rate 42 of 248 submissions, 17%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

316
Total Citations
View Citations
515
Total Downloads

Downloads (Last 12 months)203
Downloads (Last 6 weeks)38

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tiwary GStroulia ESrivastava A(2021)Compression of XML and JSON API ResponsesIEEE Access10.1109/ACCESS.2021.30730419(57426-57439)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3073041
Alkowaileet WAlsubaiee SCarey M(2020)An LSM-based tuple compaction framework for Apache AsterixDBProceedings of the VLDB Endowment10.14778/3397230.339723613:9(1388-1400)Online publication date: 26-Jun-2020
https://dl.acm.org/doi/10.14778/3397230.3397236
Siew CKumar P(2019)CitySAC: A Query-Able CityGML Compression SystemSmart Cities10.3390/smartcities20100082:1(106-117)Online publication date: 19-Mar-2019
https://doi.org/10.3390/smartcities2010008
Bottcher SHartel R(2018)RECUT: RE-Compressing partially Unordered Trees2018 IEEE International Conference on Big Data (Big Data)10.1109/BigData.2018.8622261(3996-4005)Online publication date: Dec-2018
https://doi.org/10.1109/BigData.2018.8622261
Suciu DHaritsa J(2018)XML CompressionEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_783(4742-4748)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_783
Shi SZhang R(2017)A data processing scheme based on CXML in mobile commerceJournal of Computational Methods in Sciences and Engineering10.3233/JCM-16070116:4(913-925)Online publication date: 17-Jan-2017
https://doi.org/10.3233/JCM-160701
Mantoro TAyu MAnggraini Y(2017)The performance of text file compression using Shannon-Fano and Huffman on small mobile devices2017 International Conference on Computing, Engineering, and Design (ICCED)10.1109/CED.2017.8308127(1-5)Online publication date: Nov-2017
https://doi.org/10.1109/CED.2017.8308127
Zineddine M(2016)Search engines crawling process optimization: a webserver approachInternet Research10.1108/IntR-02-2014-004526:1(311-331)Online publication date: 1-Feb-2016
https://doi.org/10.1108/IntR-02-2014-0045
Böttcher SHartel RWolters D(2016)S2CXInformation Systems10.1016/j.is.2015.09.01156:C(198-213)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1016/j.is.2015.09.011
Giancarlo RBuchsbaum A(2016)Table CompressionEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_418(2193-2198)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_418
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents