Repairing Transaction Conflicts in Optimistic Multi-Version Concurrency Control
Halls department, Hall 2
Wednesday, 28 December 2016
10:30 - 11:30
The optimistic variants of Multi-Version Concurrency Control (MVCC) avoid blocking concurrent transactions at the cost of having a validation phase. Upon failure in the validation phase, the transaction is usually aborted and restarted from scratch. The “abort and restart” approach becomes a performance bottleneck for use cases with high contention objects or long running transactions. In addition, restarting from scratch creates a negative feedback loop in the system, because the system incurs additional overhead that may create even more conflicts. In this paper, we propose a novel approach for conflict resolution in MVCC for in-memory databases. This low overhead approach summarizes the transaction programs in the form of a dependency graph. The dependency graph also contains the constructs used in the validation phase of the MVCC algorithm. Then, when encountering conflicts among transactions, our mechanism quickly detects the conflict locations in the program and partially re-executes the conflicting transactions. This approach maximizes the reuse of the computations done in the initial execution round and increases the transaction processing throughput.
Mohammad is a 5th-year PhD student at EPFL in Switzerland, advised by Prof. Christoph Koch. He is interested in database systems (in particular, transaction processing) and programming languages (in particular, compilation techniques). In his PhD research, he is pushing the limits of achieving high throughput/low latency for transaction processing while keeping the state strongly consistent, mainly by applying compilation techniques. Mentored by Phil Bernstein, he also did an internship at Microsoft Research in Redmond on Microsoft Orleans project and is currently an open-source contributor to this project.