Compression-aware in-memory query processing: Vision, system design and beyond

12Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In-memory database systems have to keep base data as well as intermediate results generated during query processing in main memory. In addition, the effort to access intermediate results is equivalent to the effort to access the base data. Therefore, the optimization of intermediate results is interesting and has a high impact on the performance of the query execution. For this domain, we propose the continuous use of lightweight compression methods for intermediate results and have the aim of developing a balanced query processing approach based on compressed intermediate results. To minimize the overall query execution time, it is important to find a balance between the reduced transfer times and the increased computational effort. This paper provides an overview and presents a system design for our vision. Our system design addresses the challenge of integrating a large and evolving corpus of lightweight data compression algorithms in an in-memory column store. In detail, we present our model-driven approach and describe ongoing research topics to realize our compression-aware query processing vision.

Cite

CITATION STYLE

APA

Hildebrandt, J., Habich, D., Damme, P., & Lehner, W. (2017). Compression-aware in-memory query processing: Vision, system design and beyond. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10195 LNCS, pp. 40–56). Springer Verlag. https://doi.org/10.1007/978-3-319-56111-0_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free