Year: 2002
Type: article
Abstract: XML is becoming the universal language for communicating information on the Web \nand has gained wide acceptance through its standardisation. As such XML plays an \nimportant enabling role for dynamic computation over the Web. Compression of XML \ndocuments is crucial in this process as, in its raw form, it often contains a sizable amount \nof redundancy. Several XML compression algorithms have been proposed but none make \nuse of the DTD when it is available. Here we present a novel compression algorithm for \nXML documents that conform to a given DTD, that separates the document’s structure \nfrom its data, taking advantage of the regular structure of XML elements. Our approach \nseems promising as we are able to show that it minimises the length of encoding under the \nassumption that document elements are independent of each other. Our presentation is \na preliminary investigation; it remains to carry out experiments to validate our approach \non real data.
Authors: Mark Levene, Peter T. Wood
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2902012187