Compression of Textual Column-Oriented Data
Keywords:Compression, column-oriented databases, LZ, PPM, BWT, entropy encoding, DSM, NSM, PAX
AbstractColumn-oriented data are well suited for compression. Since values of the same column are stored contiguously on disk, the information entropy is lower if compared to the physical data organization of conventional databases. There are many useful light-weight compression techniques targeted at specific data types and domains, like integers and small lists of distinct values, respectively. However, compression of textual values formed by skewed and high-cardinality words is usually restricted to variations of the LZ compression algorithm. So far there are no empirical evaluations that verify how other sophisticated compression methods address columnar data that store text. In this paper we shed a light on this subject by revisiting concepts of those algorithms. We also analyse how they behave in terms of compression and speed when dealing with textual columns where values appear in adjacent positions.
Download data is not yet available.
How to Cite
Garcia, V. F., & Mergen, S. L. S. (2018). Compression of Textual Column-Oriented Data. COMPUTING AND INFORMATICS, 37(2), 405–423. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/2018_2_405