无内部冲突满足P3的无α环的数据库模式分解 （Ⅰ）:分解的基本理论
THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅰ）: THE BASIC THEORY OF DECOMPOSITION
-
摘要: 文中在文献［１］、［２］、［３］讨论的基础上，讨论了数据库模式无内部冲突，但在最小归并依赖集Ｄ中存在弱右部或弱左部冲突时分解的性质和理论．为无内部冲突的满足Ｐ３的无α环的数据库模式分解算法设计提供了基础．Abstract: The properties and theory of decomposition are discussed based on , and when the minimum merge dependency set D of a database schema without inside conflict has the conflict of weak left side or right side.And a basis is founded for the decomposition algorithm design of a database schema without inside conflict and α cycle and meeting P 3 .
下载: