We use cookies to improve your experience with our site.
Zhi-Yuan Dong, Chu-Zhe Tang, Jia-Chen Wang, Zhao-Guo Wang, Hai-Bo Chen, Bin-Yu Zang. Optimistic Transaction Processing in Deterministic Database[J]. Journal of Computer Science and Technology, 2020, 35(2): 382-394. DOI: 10.1007/s11390-020-9700-5
Citation: Zhi-Yuan Dong, Chu-Zhe Tang, Jia-Chen Wang, Zhao-Guo Wang, Hai-Bo Chen, Bin-Yu Zang. Optimistic Transaction Processing in Deterministic Database[J]. Journal of Computer Science and Technology, 2020, 35(2): 382-394. DOI: 10.1007/s11390-020-9700-5

Optimistic Transaction Processing in Deterministic Database

  • Deterministic databases can improve the performance of distributed workload by eliminating the distributed commit protocol and reducing the contention cost. Unfortunately, the current deterministic scheme does not consider the performance scalability within a single machine. In this paper, we describe a scalable deterministic concurrency control, Deterministic and Optimistic Concurrency Control (DOCC), which is able to scale the performance both within a single node and across multiple nodes. The performance improvement comes from enforcing the determinism lazily and avoiding read-only transaction blocking the execution. The evaluation shows that DOCC achieves 8x performance improvement than the popular deterministic database system, Calvin.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return