Abstract
SEPA (Single Euro Payments Area) is an XML-based standard that defines the format for electronic payments between the member states of the European Union. Besides the advantages that come with an XML-based format, XML data involves one mayor disadvantage when storing and transferring large amounts of data: the storage overhead caused by the verbose structure of XML data. Therefore, we propose a compressed format for SEPA data that helps to overcome this problem. We propose to apply XML Schema Subtraction (XSDS) to the SEPA messages, such that all information that is already defined by the SEPA Schema can be removed from the SEPA messages. This compressed format allows executing navigation and updates directly on the compressed data, i.e. without prior decompression. The compression leads to a reduction of the data size of down to 11% of the original message size on average. In addition, queries can be evaluated on the compressed data directly with a speed that is comparable to that of ADSL2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adiego, J., Navarro, G., de la Fuente, P.: Lempel-Ziv Compression of Structured Text. In: Data Compression Conference 2004 (2004)
Arion, Bonifati, A., Manolescu, I., Pugliese, A.: XQueC: A Query-Conscious Compressed XML Database. ACM Transactions on Internet Technology (to appear)
Bayardo, R.J., Gruhl, D., Josifovski, V., Myllymaki, J.: An evaluation of binary xml encoding optimizations for fast stream based XML processing. In: Proc. of the 13th International Conference on World Wide Web (2004)
Böttcher, S., Hartel, R., Messinger, C.: Queryable SEPA Message Compression by XML Schema Subtraction. In: Filipe, J., Cordeiro, J. (eds.) ICEIS 2010. LNBIP, vol. 73, pp. 439–451. Springer, Heidelberg (2011)
Böttcher, S., Hartel, R., Messinger, C.: Searchable Compression of Office Documents by XML Schema Subtraction. In: Sixth International XML Database Symposium, XSym 2010, Singapore (September 2010)
Böttcher, S., Steinmetz, R.: Evaluating XPath Queries on XML Data Streams. In: British National Conference on Databases (BNCOD 2007), Glasgow, Great Britain (July 2007)
Böttcher, S., Steinmetz, R., Klein, N.: XML Index Compression by DTD Subtraction. In: International Conference on Enterprise Information Systems, ICEIS 2007 (2007)
Buneman, P., Grohe, M., Koch, C.: Path Queries on Compressed XML. In: VLDB (2003)
Burrows, M., Wheeler, D.: A block sorting loss-less data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 199–216. Springer, Heidelberg (2005)
Candan, K.S., Hsiung, W.-P., Chen, S., Tatemura, J., Agrawal, D.: AFilter: Adaptable XML Filtering with Prefix-Caching and Suffix-Clustering. In: VLDB (2006)
Cheney, J.: Compressing XML with multiplexed hierarchical models. In: Proceedings of the 2001 IEEE Data Compression Conference (DCC 2001) (2001)
Cheng, J., Ng, W.: XQzip: Querying compressed XML using structural indexing. In: Hwang, J., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 219–236. Springer, Heidelberg (2004)
Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and Searching XML Data Via Two Zips. In: Proceedings of the Fifteenth International World Wide Web Conference (2006)
Girardot, M., Sundaresan, N.: Millau: An Encoding Format for Efficient Representation and Exchange of XML over the Web. In: Proceedings of the 9th International WWW Conference (2000)
Huffman, D.A.: A method for the construction of minimum-redundancy codes. In: Proc. of the I.R.E. (1952)
Liefke, H., Suciu, D.: XMill: An Efficient Compressor for XML Data. In: Proc. of ACM SIGMOD (2000)
Min, J.K., Park, M.J., Chung, C.W.: XPRESS: A Queriable Compression for XML Data. In: Proceedings of SIGMOD (2003)
Ng, W., Lam, W.Y., Wood, P.T., Levene, M.: XCQ: A queriable XML compression system. Knowledge and Information Systems (2006)
Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking forward. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002. LNCS, vol. 2490, pp. 109–127. Springer, Heidelberg (2002)
Subramanian, H., Shankar, P.: Compressing XML documents using recursive finite state automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 282–293. Springer, Heidelberg (2006)
Tolani, P.M., Hartisa, J.R.: XGRIND: A query-friendly XML compressor. In: Proc. ICDE (2002)
Werner, C., Buschmann, C., Brandt, Y., Fischer, S.: Compressing SOAP Messages by using Pushdown Automata. In: ICWS 2006 (2006)
Zhang, N., Kacholia, V., Özsu, M.T.: A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML. In: ICDE (2004)
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
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böttcher, S., Hartel, R., Messinger, C. (2011). Using XML Schema Subtraction to Compress Electronic Payment Messages. In: Filipe, J., Cordeiro, J. (eds) Enterprise Information Systems. ICEIS 2010. Lecture Notes in Business Information Processing, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19802-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-19802-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19801-4
Online ISBN: 978-3-642-19802-1
eBook Packages: Computer ScienceComputer Science (R0)