transaction graph

A concurrency control algorithm based on the transaction conflict graph is proposed.

提出了一种基于事务冲突图的并发控制方法。

This paper mainly discusses the transaction commit graph algorithm TM2 which ensures global serializability of the committing sequences,but the method of conflict testing until the committing operation exists some disadvantages.

MDBS中并发事务的调度策略必须满足可串行化准则,论文主要分析以事务提交图为中心的调度算法TM2,虽然保证了全局事务提交顺序的可串行化,但在提交时才进行冲突检测方式存在缺点,提出改进后的事务调度算法TM3不仅保证了全局事务的可串行化和防止了全局死锁的发生,还提高了全局事务执行的并发度。