Dictionary-Based Compression Algorithms for Tree Structured Data
Yuko Itokawa, Koichiro Katoh, Tomoyuki Uchida, Takayoshi Shoudai · 2009
Abstract — Electronic data like XML/HTML documents, called tree structured data, have been rapidly increasing and have become larger day by day. In this paper, we propose an efficient compression and decompression algorithms based on the Lempel-Ziv compression scheme by improving XMill and XDemill (Liefke and Suciu, SIGMOD 2000) which is a compressor and a decompressor for tree structured data, respectively. Moreovre, in order to show the effectiveness and efficiency of our algorithms, we report experimental results of applying our algorithms to randomly created artificial large trees and real-world data.