MDBS中一种改进的并发事务调度算法  

An Improved Scheduling Algorithm of Concurrent Transactions in MDBS

作　　者：王元珍[1] 龚卫华[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,武汉430074

出　　处：《计算机工程与应用》2005年第31期11-13,40,共4页Computer Engineering and Applications

基　　金：国家信息产业部电子发展基金项目

摘　　要：MDBS中并发事务的调度策略必须满足可串行化准则,论文主要分析以事务提交图为中心的调度算法TM2,虽然保证了全局事务提交顺序的可串行化,但在提交时才进行冲突检测方式存在缺点,提出改进后的事务调度算法TM3不仅保证了全局事务的可串行化和防止了全局死锁的发生,还提高了全局事务执行的并发度。最后通过实验在数据库加速引擎中进行模拟,对比了两种调度算法的性能。The scheduling strategies of concurrent transactions must satisfy the criteria of serializability in Multidatabase System. 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. The improved algorithm TM3 firstly judges the conflict and then tests the committing loop in the commit graph, which not only ensures the conflict serializability of global transactions and keeps from global deadlock, but also increases the executing concurrent degree of global transaction.

关 键 词：事务提交图 全局事务 全局可串行化 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]