The BWT compression method is an implementation of the Burrows-Wheeler Transform compression algorithm with Huffman encoding. It was popularized by the UNIX and Linux BZip2 program.
It offers significantly better compression than Deflate (the traditional PKZIP 2.04g compression method) but takes longer to compress and decompress data. Xceed Software tests have shown BWT to often achieve between 20 to 30% better compression than Deflate on many popular file types such as databases, pictures, text and executable files.
BWT is considered to be one of the most efficient compression algorithms for compressing XML data.