基于优先执行关系闭包运算的事务可串行化判定方法  

DECISION METHOD OF TRANSACTION SERIALIZABILITY BASED ON CLOSURE OF PRIORITY EXECUTION RELATIONS

作　　者：熊中敏[1,2] 王佳艳 汪博 陈明 Xiong Zhongmin;Wang Jiayan;Wang Bo;Chen Ming(School of Information, Shanghai Ocean University, Shanghai 201306, China;Key Laboratory of Fisheries Information,Ministry of Agriculture, Shanghai 201306, China)

机构地区：[1]上海海洋大学信息学院,上海201306 [2]农业部渔业信息重点实验室,上海201306

出　　处：《计算机应用与软件》2019年第9期52-57,99,共7页Computer Applications and Software

基　　金：国家自然科学基金项目(61702325);上海市自然科学基金项目(16ZR14100);上海市科技创新行动(16391902902)

摘　　要：现代数据库技术支持并发用户,会产生大量的并发事务。为了提高数据库系统的性能和维护系统的一致性,必须保证事务并发执行的可串行化调度。可串行化检测是数据库系统中事务管理的关键技术,一般采用执行图的判定方法。从关系运算的代数方法出发,提出基于事务执行优先关系的闭包运算和由此建立的联合逻辑公式的计算,通过逻辑判定来检验并发事务的可串行化。通过定理证明和实例验证,该方法取得了同执行图判定相同的效果,而且判定更直观,更易于操作实现,不需要建立复杂的图数据结构和在图搜索中检测环是否出现。Modern database technology supports concurrent users and generates a large number of concurrent transactions. In order to improve the performance of the database system and maintain the consistency of the system, it is necessary to ensure the serializable scheduling of concurrent transactions. Serializability detection is the key technology of transaction management in database system, and an execution graph is used for this task. Starting from the algebra method of relational operation, this paper presented the closure operation based on the priority relation of transaction execution and the calculation of the joint logic formula established therefrom. The serializability of concurrent transactions was tested by logical decision. Through theorem proving and examples analysis, the proposed method achieves the analysis results as same as the execution graph. It does not need to establish complex graph data structure and detect whether the ring appears in graph search.

关 键 词：数据库 并发事务 可串行化 闭包计算 逻辑公式 

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