主动规则的并发控制与死锁处理  

Concurrency Control and Deadlock Recovery of Active Rules

作　　者：左万利[1] 金阳[1] 赫枫龄[1] 

机构地区：[1]吉林大学计算机科学系,吉林长春130012

出　　处：《小型微型计算机系统》2002年第10期1181-1184,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金 ( No.6 96 730 15 )资助 ;吉林省科技发展计划项目 (吉科合字第 2 0 0 0 0 111)资助

摘　　要：在基于规则的主动数据库系统中 ,被触发规则通常以事务模式运行 ,这些并行事务由规则耦合方式确定其开始处理时刻和可串行化提交次序 .本文根据并行事务对于共享数据对象的锁继承和锁剥夺关系 ,提出了一个并发控制算法 ,并基于事务树 (森林 )给出一个有效的死锁检测算法和具有最小代价的死锁恢复算法 .In rule-based active database systems, triggered rules are generally executed in the context of database transactions. Coupling mode, specified in rule definition, determines when a rule transaction will be launched and how these parallel rule transactions are to be serialized. Following an investigation on lock inheritance and lock preemption among these concurrent transactions when accessing shared data objects, this paper proposes an concurrency control algorithm, and based on transaction tree (forest), an effective deadlock detection algorithm and a minimal-price based deadlock recovery algorithm are presented.

关 键 词：主动规则 并发控制 死锁处理 主动数据库 ECA规则 事务 耦合方式 

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