arrow
Return

A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems

delete2021-02-01
delete7
PRE
AI
L
Liang Li
王国仁 (Guoren Wang) *
吴刚 (Gang Wu)
袁野 (Ye Yuan) *
陈蕾 cover
陈蕾 (Lei Chen)
香莲 (Xiang Lian)
DOI:10.1109/TKDE.2019.2930987delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In-memory databases (IMDBs) are gaining increasing popularity in big data applications, where clients commit updates intensively. Specifically, it is necessary for IMDBs to have efficient snapshot performance to support certain special applications (e.g., consistent checkpoint, HTAP). Formally, the in-memory consistent snapshot problem refers to taking an in-memory consistent time-in-point snapshot with the constraints that 1) clients can read the latest data items and 2) any data item in the snapshot should not be overwritten. Various snapshot algorithms have been proposed in academia to trade off throughput and latency, but industrial IMDBs such as Redis adhere to the simple fork algorithm. To understand this phenomenon, we conduct comprehensive performance evaluations on mainstream snapshot algorithms. Surprisingly, we observe that the simple fork algorithm indeed outperforms the state-of-the-arts in update-intensive workload scenarios. On this basis, we identify the drawbacks of existing research and propose two lightweight improvements. Extensive evaluations on synthetic data and Redis show that our lightweight improvements yield better performance than fork, the current industrial standard, and the representative snapshot algorithms from academia. Finally, we have opensourced the implementation of all the above snapshot algorithms so that practitioners are able to benchmark the performance of each algorithm and select proper methods for different application scenarios.
Keywords:
In-memory database systems
snapshot algorithms
checkpoints
HTAP
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.7K
Citations:
3.2W

Organization

K
Kent State University
Scholars:
2.7K
Papers: 2.3K
Citations: 6.6K
U
University System of Ohio
Scholars:
15.4W
Papers: 13.0W
Citations: 200
N
northeastern university - china
Scholars:
3.1W
Papers: 2.7W
Citations: 37
N
nanjing university
Scholars:
7.7W
Papers: 5.6W
Citations: 87
researcher View more organizations