相交数据集合的R/W事务可串行化判别方法  

Judgement of the Serialization for R/W Transactions with Intersecting Data Sets

作　　者：李新[1,2] 

机构地区：[1]汕头大学工学院计算机系,广东汕头515063 [2]汕头大学智能制造技术教育部重点实验室,广东汕头515063

出　　处：《小型微型计算机系统》2009年第2期275-278,共4页Journal of Chinese Computer Systems

基　　金：汕头大学青年科研基金项目(YR07004)资助

摘　　要：R/W事务是应用中广泛存在的一类人工交互性长事务,采用传统的两段锁协议对R/W事务进行并发控制,会严重影响到系统的执行效率.为此,曾经提出一种基于数据集合分析的新的并发控制方法,有效地解决了系统效率的问题.然而,以前的方法在相交数据集合的情况下,使用较为复杂,并且对于两种类型的R/W事务—原子关系和相交数据集合关系,事务提交采用了不同的判别准则;增加了系统实现的复杂度.本文在原有方法的基础上,通过对R/W事务特性的进一步分析和对数据集合关系的演绎推理,提出了新的事务提交判别准则,统一了两种类型R/W事务的并发控制策略.新的方法具有更高的效率,且简单易行,提高了系统的可实现性.R/W transaction is a kind of long duration transaction with manual alternation. It exists in quite a few professions. The protocol of two phase lock is a traditional method to manage concurrent transactions. However, it＇s not fit for R/W transaction because of the problem of low efficiency. A method for concurrent control of R/W transaction has been presented two years ago which is based on the analysis of data sets. There＇re two different rules in that method, one for transactions with atomic relationship and the other for those with the relationship of intersecting data sets. And the application for intersecting data sets is rather complicated. In this paper, the method on data sets is improved. The characteristics of R/W transaction are analyzed more deeply and some useful conclusions are deduced. A new rule for concurrent control of R/W transaction is presented to replace old ones. It has much higher efficiency and is fit for both transactions with atomic relationship and those with the relationship of intersecting data sets.

关 键 词：R/W事务 可串行化 相交数据集合 同序可串行化 事务提交准则 

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