Memory-aware sizing for in-memory databases
File(s)DTR14-1.pdf (940.44 KB)
Published version
Author(s)
Molka, Karsten
Casale, Giuliano
Molka, Thomas
Moore, Laura
Type
Report
Abstract
In-memory database systems are among the technological
drivers of big data processing. In this paper we
apply analytical modeling to enable efficient sizing of in-memory
databases. We present novel response time approximations under
online analytical processing workloads to model thread-level forkjoin
and per-class memory occupation.We combine these approximations
with a non-linear optimization program to minimize
memory swapping in in-memory database clusters. We compare
our approach with state-of-the-art response time approximations
and trace-driven simulation using real data from an SAP HANA
in-memory system and show that our optimization model is
significantly more accurate than existing approaches at similar
computational costs.
drivers of big data processing. In this paper we
apply analytical modeling to enable efficient sizing of in-memory
databases. We present novel response time approximations under
online analytical processing workloads to model thread-level forkjoin
and per-class memory occupation.We combine these approximations
with a non-linear optimization program to minimize
memory swapping in in-memory database clusters. We compare
our approach with state-of-the-art response time approximations
and trace-driven simulation using real data from an SAP HANA
in-memory system and show that our optimization model is
significantly more accurate than existing approaches at similar
computational costs.
Date Issued
2014-01-01
Citation
Departmental Technical Report: 14/1, 2014, pp.1-10
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
10
Journal / Book Title
Departmental Technical Report: 14/1
Copyright Statement
© 2014 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Publication Status
Published
Article Number
14/1