Gria:an efficient deterministic concurrency control protocol

作     者：Xinyuan WANG Yun PENG Hejiao HUANG 

作者机构：School of Computer Science and TechnologyHarbin Institute of TechnologyShenzhen 518055China Institute of Artificial Intelligence and BlockchainGuangzhou UniversityGuangzhou 510006China 

出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)

年 卷 期：2024年第18卷第4期

页      面：25-37页

核心收录：

学科分类：0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Key Laboratory Ministry of Industry and Information Technology of China,Shenzhen Science and Technology Program(Nos.GXWD20220817124827001 and JCYJ20210324132406016) National Natural Science Foundation of China(Grant No.61732022) National Science Foundation of Guangdong Province(No.2023A1515030273) 

主　　题：deterministic concurrency control transaction processing 

摘      要：Deterministic databases are able to reduce coordination costs in a *** property has fostered a significant interest in the design of efficient deterministic concurrency control ***,the state-of-the-art deterministic concurrency control protocol Aria has three ***,it is impractical to configure a suitable batch size when the read-write set is ***,Aria running in low-concurrency scenarios,e.g.,a single-thread scenario,suffers from the same conflicts as running in high-concurrency ***,the single-version schema brings write-after-write *** address these issues,we propose Gria,an efficient deterministic concurrency control *** has the following ***,the batch size of Gria is ***,Gria’s conflict probability in low-concurrency scenarios is lower than that in high-concurrency ***,Gria has no write-after-write conflicts by adopting a multi-version *** further reduce conflicts,we propose two optimizations:a reordering mechanism as well as a rechecking *** evaluation result on two popular benchmarks shows that Gria outperforms Aria by 13x.