Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3035918.3035919 | SIGMOD Conference |
Field | DocType | Citations |
Transaction processing,Serializability,Concurrency control,Computer science,Online transaction processing,Multiversion concurrency control,Distributed transaction,Optimistic concurrency control,Database,Transaction processing system,Distributed computing | Conference | 1 |
PageRank | References | Authors |
0.37 | 28 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad Dashti | 1 | 46 | 4.52 |
| Sachin Basil John | 2 | 1 | 0.37 |
| Amir Shaikhha | 3 | 37 | 7.31 |
| Christoph Koch | 4 | 2817 | 163.43 |