Welcome to the InfoSci Platform
Reference Hub5
XML Compression for Web Services on Resource-Constrained Devices

XML Compression for Web Services on Resource-Constrained Devices

Christian Werner, Carsten Buschmann, Ylva Brandt, Stefan Fischer
Copyright: © 2008 |Volume: 5 |Issue: 3 |Pages: 20
ISSN: 1545-7362|EISSN: 1546-5004|ISSN: 1545-7362|EISBN13: 9781615204489|EISSN: 1546-5004|DOI: 10.4018/jwsr.2008070103
Cite Article Cite Article

MLA

Werner, Christian, et al. "XML Compression for Web Services on Resource-Constrained Devices." IJWSR vol.5, no.3 2008: pp.44-63. http://doi.org/10.4018/jwsr.2008070103

APA

Werner, C., Buschmann, C., Brandt, Y., & Fischer, S. (2008). XML Compression for Web Services on Resource-Constrained Devices. International Journal of Web Services Research (IJWSR), 5(3), 44-63. http://doi.org/10.4018/jwsr.2008070103

Chicago

Werner, Christian, et al. "XML Compression for Web Services on Resource-Constrained Devices," International Journal of Web Services Research (IJWSR) 5, no.3: 44-63. http://doi.org/10.4018/jwsr.2008070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Compared to other middleware approaches like CORBA or Java RMI the protocol overhead of SOAP is very high. This fact is not only disadvantageous for several performance-critical applications, but especially in environments with limited network bandwidth or resource-constrained computing devices. Although recent research work concentrated on more compact, binary representations of XML data only very few approaches account for the special characteristics of SOAP communication. In this article we will discuss the most relevant state-of-the-art technologies for compressing XML data. Furthermore, we will present a novel solution for compacting SOAP messages. In order to achieve significantly better compression rates than current approaches, our compressor utilizes structure information from an XML Schema or WSDL document. With this additional knowledge on the “grammar” of the exchanged messages, our compressor generates a single custom pushdown automaton, which can be used as a highly efficient validating parser as well as a highly efficient compressor. The main idea is to tag the transitions of the automaton with short binary identifiers that are then used to encode the path trough the automaton during parsing. Our approach leads to extremely compact data representations and is also usable in environments with very limited CPU and memory resources.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.