Experimental Study on Concurrency Control Algorithms in In-Memory Databases

被引:0
|
作者
Zhao H.-Y. [1 ,2 ]
Zhao Z.-H. [1 ,2 ]
Yang W.-Q. [1 ,2 ]
Lu W. [1 ,2 ]
Li H.-X. [3 ]
Du X.-Y. [1 ,2 ]
机构
[1] Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, Ministry of Education, Beijing
[2] School of Information, Renmin University of China, Beijing
[3] Billing Platform Department, Tencent Technology (Beijing) Co. Ltd, Beijing
来源
Ruan Jian Xue Bao/Journal of Software | 2022年 / 33卷 / 03期
关键词
3TS; Concurrency control algorithm; Database system; In-memory database; Transaction processing;
D O I
10.13328/j.cnki.jos.006454
中图分类号
学科分类号
摘要
The concurrency control algorithm is a key component to guarantee the correctness and efficiency of executing transactions. Thus far, substantial effort has been devoted to proposing new concurrency controls algorithms in both database industry and academia. This study abstracts a common paradigm of the state-of-the-art and summarizes the core idea of concurrency control algorithms as “ordering-and-verifying”. Then, the existing concurrency control algorithms are re-presented following the ordering-and-verifying paradigm. Based on extensive experiments under an open-source memory-based distributed transaction testbed called 3TS, it is systematically demonstrated the advantages and disadvantages of the mainstream state-of-the-art concurrency control algorithms. Finally, the preferable application scenario is summarized for each algorithm and some valuable references are provided for the follow-up research of concurrency control algorithms used in in-memory databases. © Copyright 2022, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:867 / 890
页数:23
相关论文
共 44 条
  • [41] (2021)
  • [42] (2021)
  • [43] Cooper BF, Silberstein A, Tam E, Ramakrishnan R, Sears R., Benchmarking cloud serving systems with YCSB, Proc. of the 1st ACM Symp. on Cloud Computing (SoCC 2010), pp. 143-154, (2010)
  • [44] (2021)