Opportunities for optimism in contended main-memory multicore transactions
Name
3377369.3377373.pdf
Description
Published version
Size
456.11 KB
Format
Unknown
Checksum (MD5)
d8570c193bf91524569d32933e5a3081
Author(s)
Huang, Y
Qian, W
Kohler, E
Liskov, B
Shrira, L
Date Issued
January 2020
Journal
Proceedings of the VLDB Endowment
Publisher
VLDB Endowment
Version
Final published version
Abstract
Optimistic concurrency control, or OCC, can achieve excellent performance on uncontended workloads for main-memory transactional databases. Contention causes OCC's performance to degrade, however, and recent concurrency control designs, such as hybrid OCC/locking systems and variations on multiversion concurrency control (MVCC), have claimed to outperform the best OCC systems. We evaluate several concurrency control designs under varying contention and varying workloads, including TPCC, and find that implementation choices unrelated to concurrency control may explain much of OCC's previously-reported degradation. When these implementation choices are made sensibly, OCC performance does not collapse on high-contention TPC-C. We also present two optimization techniques, commit-time updates and timestamp splitting, that can dramatically improve the highcontention performance of both OCC and MVCC. Though these techniques are known, we apply them in a new context and highlight their potency: when combined, they lead to performance gains of 3:4 for MVCC and 3:6 for OCC in a TPC-C workload.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.14778/3377369.3377373
