ABSTRACT

In this seminars, we give a brief introduction to data compression followed by a review of various compression strategies designed specifically for XML data. We then present two novel XML compression techniques, AXECHOP and TREECHOP.
AXECHOP uses a grammar-based approach that exploits the significant structural redundancies within XML documents, while TREECHOP supports querying of compressed XML data without requiring prior decompression. TREECHOP, which supports querying of compressed XML data without requiring full decompression. Unlike other query-capable XML compression schemes, TREECHOP requires only a single pass over the input document during the compression process, resulting in an efficient, online operation that is well-suited for transmission of compressed XML documents over a network.
We compare these two techniques to other XML compression schemes with respect to compression ratio and compression time, and describe our future research.