Optimizations and Heuristics to improve Compression in Columnar Database Systems
Abstract
In-memory columnar databases have become mainstream over the last decade and have vastly improved the fast processing of large volumes of data through multi-core parallelism and in-memory compression thereby eliminating the usual bottlenecks associated with disk-based databases. For scenarios, where the data volume grows into terabytes and petabytes, keeping all the data in memory is exorbitantly expensive. Hence, the data is compressed efficiently using different algorithms to exploit the multi-core parallelization technologies for query processing. Several compression methods are studied for compressing the column array, post Dictionary Encoding. In this paper, we will present two novel optimizations in compression techniques - Block Size Optimized Cluster Encoding and Block Size Optimized Indirect Encoding - which perform better than their predecessors. In the end, we also propose heuristics to choose the best encoding amongst common compression schemes.
Cite
@article{arxiv.1609.07823,
title = {Optimizations and Heuristics to improve Compression in Columnar Database Systems},
author = {Jayanth Jayanth},
journal= {arXiv preprint arXiv:1609.07823},
year = {2016}
}
Comments
Author keywords: Database Compression, Database Optimization, Encoding Schemes, In-memory Columnar Databases. Key-phrases: block size, cluster encoding, indirect encoding. Content Information: 4 pages, 5 sections, 2 figures, 1 table, 2 algorithms, 11 equations and 4 references