This paper describes a new XML compression scheme that offers both high compression ratios and short query response time.
Its core is a fully reversible transform featuring substitution of every word in an XML document using a semi-dynamic dictionary,
effective encoding of dictionary indices, as well as numbers, dates and times found in the document, and grouping data within
the same structural context in individual containers. The results of conducted tests show that the proposed scheme attains
compression ratios rivaling the best available algorithms, and fast compression, decompression, and query processing.
Keywords XML compression - XML searching - XML transform - semi-structural data compression - semi-structural data searching