基于图论理论解决关系数据库死锁方法的研究

Discussion on Solution of RDB Dead Lock Based on Graph Theory

根据关系数据库的基本理论,关系型数据库对数据的存储使用了标准的共享锁、修改锁、独占锁等机制,提供数据库、表、页面、记录等多种不同的资源粒度以及锁升级机制。因此所有的关系型数据库,都存在着并发访问的锁资源争夺风险,如何能在确保数据一致性的前提下避免因锁资源争夺而导致数据库系统性能下降甚至崩溃,一直是数据库系统及其相关应用等领域内关注的焦点。文章将基于图论理论的基础,分析和探讨解决关系数据库死锁的思路和方法,通过构造一些基础的数学模型来分解和本质化死锁现象,提出一些解决方法和理论思路。

Through RDB （Relation DataBase） basic theory, general RDB use the standard mechanism on data I/O management such as share lock,exclusive lock,and provide many different resource granularity levels such as database, table ,page ,record and the lock upgrade mechanism on them. Because of that, the contesting of data resource locking on concurrent access is a general problem for all RDB. How to prevent RDB from performance declining, even crash down, because of deadlock, is always a focus in the database technology field. This paper studies and analyses the solution of RDB Deadlock based on the graph theory, and give some methods and ideas through uncovering the essence of the deadlock based on building some basic mathematics model and structure.