基于语义事务分解的可串行性  

Serializability of Semantic-based Decomposition of Transactions

作　　者：陈子军[1] 刘国华[1] 周傲英[1] 

机构地区：[1]复旦大学计算机科学系

出　　处：《小型微型计算机系统》2003年第8期1483-1487,共5页Journal of Chinese Computer Systems

基　　金：教育部重点科技项目 ( 990 3 8)资助

摘　　要：数据库应用中长事务的出现严重降低了系统的性能 ,一些研究者为解决这一问题提出了利用事务的语义信息对事务进行分解的方法 ,但所得结论仍然存在缺陷 .本文从用户定义的后续集出发给出了正确步进串行历史的概念 ,可以很容易证明正确步进串行历史是用户可接受的正确历史 ,并以此作为判定一个历史是否正确的基础 .最后 ,证明了当用户给出的后续集满足约束 2时 。The system performance is decreased greatly by the appearance of long lived transaction in the application of databases. Some researchers proposed the decomposition of transactions to solve this problem by using the semantic information of transactions to improve it. But the result is of some drawbacks. In this paper, firstly based on Successor Set the concept of Correct Stepwise Serial History is introduced . Because it is easy to prove that a Correct Stepwise Serial History is a correct history that is accepted by users , Correct Stepwise Serial History could become the basis of deciding a correct history . Finally, the necessary and sufficient condition of deciding a correct history is proved with the acyclicy of Optimized Precedence Graph.

关 键 词：并发控制 可串行性 事务处理 数据库管理系统 

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