Decomposing and re-composing lightweight compression schemes - and why it matters
We argue for a richer view of the space of lightweight compression schemes for columnar DBMSes: We demonstrate how even simple simple schemes used in DBMSes decompose into constituent schemes through a columnar perspective on their decompression. With our concrete examples, we touch briefly on what follows from these and other decompositions: Composition of alternative compression schemes as well as other practical and analytical implications.
|Keywords||Analytic DBMS, Columar, Column space, Column store, Columnar compression, Columnar processing, Compression, Compression scheme, Compression scheme decomposition, DBMS, Decompression, Delta, For, Frame of reference, Function decomposition, Gather, L-0 norm, L-infinity norm, Lightweight compression, Low degree polynomials, Maximum norm, Metric spaces, Modeling, Patched frame of reference, Patching, Pfor, Piecewise polynomials, Polynomial models, Prefix sum, Rle, RPE, Run length encoding, Run position encoding, Scatter, Step functions|
|Conference||IEEE International Conference on Data Engineering|
Rozenberg, E. (2018). Decomposing and re-composing lightweight compression schemes - and why it matters. In IEEE 34th International Conference on Data Engineering, ICDE 2018 (pp. 1670–1671). doi:10.1109/ICDE.2018.00207