TY - GEN
T1 - Looking into the Peak Memory Consumption of Epoch-Based Reclamation in Scalable in-Memory Database Systems
AU - Mitake, Hitoshi
AU - Yamada, Hiroshi
AU - Nakajima, Tatsuo
PY - 2019
Y1 - 2019
N2 - Deferred memory reclamation is an essential mechanism of scalable in-memory database management systems (DBMSs) that releases stale objects asynchronously to free operations. Modern scalable in-memory DBMSs commonly employ a deferred reclamation mechanism named epoch-based reclamation (EBR). However, no existing research has studied the EBR’s trade-off between performance improvements and memory consumption; its peak memory consumption makes capacity planning difficult and sometimes causes disruptive performance degradation. We argue that gracefully controlling the peak memory usage is a key to achieving stable throughput and latency of scalable EBR-based in-memory DBMSs. This paper conducts a quantitative analysis and evaluation of a representative EBR-based DBMS, Silo, from the viewpoint of memory management. Our evaluation reveals that the integration of conventional solutions fails to achieve stable performance with lower memory utilization, and Glasstree-based Silo achieves a 20% higher throughput, latencies characterized by an 81% lower standard deviation, and 34% lower peak memory usage than Masstree-based Silo even under read-majority workloads.
AB - Deferred memory reclamation is an essential mechanism of scalable in-memory database management systems (DBMSs) that releases stale objects asynchronously to free operations. Modern scalable in-memory DBMSs commonly employ a deferred reclamation mechanism named epoch-based reclamation (EBR). However, no existing research has studied the EBR’s trade-off between performance improvements and memory consumption; its peak memory consumption makes capacity planning difficult and sometimes causes disruptive performance degradation. We argue that gracefully controlling the peak memory usage is a key to achieving stable throughput and latency of scalable EBR-based in-memory DBMSs. This paper conducts a quantitative analysis and evaluation of a representative EBR-based DBMS, Silo, from the viewpoint of memory management. Our evaluation reveals that the integration of conventional solutions fails to achieve stable performance with lower memory utilization, and Glasstree-based Silo achieves a 20% higher throughput, latencies characterized by an 81% lower standard deviation, and 34% lower peak memory usage than Masstree-based Silo even under read-majority workloads.
KW - Epoch-based reclamation
KW - In-memory database
KW - Index tree structure
KW - Multicore scalability
UR - http://www.scopus.com/inward/record.url?scp=85077129226&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85077129226&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-27618-8_1
DO - 10.1007/978-3-030-27618-8_1
M3 - Conference contribution
AN - SCOPUS:85077129226
SN - 9783030276171
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 3
EP - 18
BT - Database and Expert Systems Applications - 30th International Conference, DEXA 2019, Proceedings
A2 - Hartmann, Sven
A2 - Küng, Josef
A2 - Anderst-Kotsis, Gabriele
A2 - Khalil, Ismail
A2 - Chakravarthy, Sharma
A2 - Tjoa, A Min
PB - Springer
T2 - 30th International Conference on Database and Expert Systems Applications, DEXA 2019
Y2 - 26 August 2019 through 29 August 2019
ER -