Standard

Revisiting Data Compression in Column-Stores. / Slesarev, Alexander; Klyuchikov, Evgeniy; Smirnov, Kirill; Chernishev, George.

Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings. ред. / Christian Attiogbé; Sadok Ben Yahia. Springer Nature, 2021. стр. 279-292 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 12732 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаяРецензирование

Harvard

Slesarev, A, Klyuchikov, E, Smirnov, K & Chernishev, G 2021, Revisiting Data Compression in Column-Stores. в C Attiogbé & S Ben Yahia (ред.), Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 12732 LNCS, Springer Nature, стр. 279-292, 10th International Conference on Model and Data Engineering, MEDI 2021, Virtual, Online, 21/06/21. https://doi.org/10.1007/978-3-030-78428-7_22

APA

Slesarev, A., Klyuchikov, E., Smirnov, K., & Chernishev, G. (2021). Revisiting Data Compression in Column-Stores. в C. Attiogbé, & S. Ben Yahia (Ред.), Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings (стр. 279-292). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 12732 LNCS). Springer Nature. https://doi.org/10.1007/978-3-030-78428-7_22

Vancouver

Slesarev A, Klyuchikov E, Smirnov K, Chernishev G. Revisiting Data Compression in Column-Stores. в Attiogbé C, Ben Yahia S, Редакторы, Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings. Springer Nature. 2021. стр. 279-292. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-78428-7_22

Author

Slesarev, Alexander ; Klyuchikov, Evgeniy ; Smirnov, Kirill ; Chernishev, George. / Revisiting Data Compression in Column-Stores. Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings. Редактор / Christian Attiogbé ; Sadok Ben Yahia. Springer Nature, 2021. стр. 279-292 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{2cdd28592f954cd0b05e4554b38f5c38,
title = "Revisiting Data Compression in Column-Stores",
abstract = "Data compression is widely used in contemporary column-oriented DBMSes to lower space usage and to speed up query processing. Pioneering systems have introduced compression to tackle the disk bandwidth bottleneck by trading CPU processing power for it. The main issue of this is a trade-off between the compression ratio and the decompression CPU cost. Existing results state that light-weight compression with small decompression costs outperforms heavy-weight compression schemes in column-stores. However, since the time these results were obtained, CPU, RAM, and disk performance have advanced considerably. Moreover, novel compression algorithms have emerged. In this paper, we revisit the problem of compression in disk-based column-stores. More precisely, we study the I/O-RAM compression scheme which implies that there are two types of pages of different size: disk pages (compressed) and in-memory pages (uncompressed). In this scheme, the buffer manager is responsible for decompressing pages as soon as they arrive from disk. This scheme is rather popular as it is easy to implement: several modern column and row-stores use it. We pose and address the following research questions: 1) Are heavy-weight compression schemes still inappropriate for disk-based column-stores?, 2) Are new light-weight compression algorithms better than the old ones?, 3) Is there a need for SIMD-employing decompression algorithms in case of a disk-based system? We study these questions experimentally using a columnar query engine and Star Schema Benchmark.",
keywords = "Compression, PosDB, Query execution",
author = "Alexander Slesarev and Evgeniy Klyuchikov and Kirill Smirnov and George Chernishev",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 10th International Conference on Model and Data Engineering, MEDI 2021 ; Conference date: 21-06-2021 Through 23-06-2021",
year = "2021",
doi = "10.1007/978-3-030-78428-7_22",
language = "English",
isbn = "9783030784270",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "279--292",
editor = "Christian Attiogb{\'e} and {Ben Yahia}, Sadok",
booktitle = "Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings",
address = "Germany",

}

RIS

TY - GEN

T1 - Revisiting Data Compression in Column-Stores

AU - Slesarev, Alexander

AU - Klyuchikov, Evgeniy

AU - Smirnov, Kirill

AU - Chernishev, George

N1 - Publisher Copyright: © 2021, Springer Nature Switzerland AG.

PY - 2021

Y1 - 2021

N2 - Data compression is widely used in contemporary column-oriented DBMSes to lower space usage and to speed up query processing. Pioneering systems have introduced compression to tackle the disk bandwidth bottleneck by trading CPU processing power for it. The main issue of this is a trade-off between the compression ratio and the decompression CPU cost. Existing results state that light-weight compression with small decompression costs outperforms heavy-weight compression schemes in column-stores. However, since the time these results were obtained, CPU, RAM, and disk performance have advanced considerably. Moreover, novel compression algorithms have emerged. In this paper, we revisit the problem of compression in disk-based column-stores. More precisely, we study the I/O-RAM compression scheme which implies that there are two types of pages of different size: disk pages (compressed) and in-memory pages (uncompressed). In this scheme, the buffer manager is responsible for decompressing pages as soon as they arrive from disk. This scheme is rather popular as it is easy to implement: several modern column and row-stores use it. We pose and address the following research questions: 1) Are heavy-weight compression schemes still inappropriate for disk-based column-stores?, 2) Are new light-weight compression algorithms better than the old ones?, 3) Is there a need for SIMD-employing decompression algorithms in case of a disk-based system? We study these questions experimentally using a columnar query engine and Star Schema Benchmark.

AB - Data compression is widely used in contemporary column-oriented DBMSes to lower space usage and to speed up query processing. Pioneering systems have introduced compression to tackle the disk bandwidth bottleneck by trading CPU processing power for it. The main issue of this is a trade-off between the compression ratio and the decompression CPU cost. Existing results state that light-weight compression with small decompression costs outperforms heavy-weight compression schemes in column-stores. However, since the time these results were obtained, CPU, RAM, and disk performance have advanced considerably. Moreover, novel compression algorithms have emerged. In this paper, we revisit the problem of compression in disk-based column-stores. More precisely, we study the I/O-RAM compression scheme which implies that there are two types of pages of different size: disk pages (compressed) and in-memory pages (uncompressed). In this scheme, the buffer manager is responsible for decompressing pages as soon as they arrive from disk. This scheme is rather popular as it is easy to implement: several modern column and row-stores use it. We pose and address the following research questions: 1) Are heavy-weight compression schemes still inappropriate for disk-based column-stores?, 2) Are new light-weight compression algorithms better than the old ones?, 3) Is there a need for SIMD-employing decompression algorithms in case of a disk-based system? We study these questions experimentally using a columnar query engine and Star Schema Benchmark.

KW - Compression

KW - PosDB

KW - Query execution

UR - http://www.scopus.com/inward/record.url?scp=85111386159&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/cf619f41-351f-35b7-8f1f-b78a6a61329d/

U2 - 10.1007/978-3-030-78428-7_22

DO - 10.1007/978-3-030-78428-7_22

M3 - Conference contribution

AN - SCOPUS:85111386159

SN - 9783030784270

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 279

EP - 292

BT - Model and Data Engineering - 10th International Conference, MEDI 2021, Proceedings

A2 - Attiogbé, Christian

A2 - Ben Yahia, Sadok

PB - Springer Nature

T2 - 10th International Conference on Model and Data Engineering, MEDI 2021

Y2 - 21 June 2021 through 23 June 2021

ER -

ID: 84794336