Aggregates caching in columnar in-memory databases

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

Abstract

The mixed database workloads found in enterprise applications are comprised of short-running transactional as well as analytical queries with resource-intensive data aggregations. In this context, caching the query results of long-running queries is desirable as it increases the overall performance. However, traditional caching approaches are inefficient in a way that changes in the base data result in invalidation or recalculation of cached results. Columnar in-memory databases with a main-delta architecture are well-suited for a novel caching mechanism for aggregate queries that is the main contribution of this paper. With the separation into readoptimized main storage and write-optimized delta storage, we do not invalidate cached query results when new data is inserted to the delta storage. Instead, we use the cached query result and combine it with the newly added records in the delta storage. We evaluate this caching mechanism with mixed database workloads and show how it compares to existing work in this area.

Cite

CITATION STYLE

APA

Müller, S., & Plattner, H. (2015). Aggregates caching in columnar in-memory databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8921, pp. 69–81). Springer Verlag. https://doi.org/10.1007/978-3-319-13960-9_6

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