Differences In Xml Documents Based On File Compression Algorithm

XML has become the de facto standard for information exchange,data transmission and storage on the web.However,due to XML' s self describing property,it suffers from verbosity problem.In systems with limited resources such as PDA and Smart Phone,this problem will largely deteriorate the network performance.In order to relieve systems' burden, many sophisticated XML compression algorithms have been proposed. Nevertheless,most of the XML compression algorithms compress single document without consideration to the relationships among document archive.This paper analyzes the potential drawbacks in existing compression algorithms and proposes a novel compression algorithm,named XDrill, which is based on computing the differences among XML files.XDrill explores the verbosity among XML documents by splitting the virtual XML document tree.Our performance study shows that the compression ratio of XDrill is comparable to XMill when compressing a single XML document and outperforms XMill when compressing XML documents archive.