Abstract: By analyzing the property and characteristics of the minimum merge dependency set of F when D has weak left side conflict or weak right side conflict, the necessary and sufficient condition under which a database schema without inside conflict can be decomposed into one meeting PS and α-acyclic is given. A decomposition algorithm is given accordingly with the proof for its termination and correction.

Key words: Without inside conflict, Decomposition algorithm, α-acyclic, Simple normal form

摘要： 通过分析在FD集F的最小归并依赖集存在弱左部或弱右部冲突时所具有的性质和特征，讨论并给出了满足PS(保持FD，无损连接且满足SNF)且无α环分解的充要条件和算法，对算法的正确性、可终止性进行了证明，并对算法的时间复杂度给出了分析。

关键词: 无内部冲突, 分解算法, 无α环, 简单范式

CLC Number: 

• TP311.13