作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (09): 76-78.

• 软件技术与数据库 • 上一篇    下一篇

FD环境下满足PS及无α环模式分解问题研究

赵龄强1,郝忠孝1,2,3,顾照鹏1   

  1. (1. 哈尔滨理工大学计算机科学与技术学院,哈尔滨 150080;2. 齐齐哈尔大学计算机学院,齐齐哈尔 161006;3. 哈尔滨工业大学计算机科学与技术学院,哈尔滨 150001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-05 发布日期:2007-05-05

Research of Schema Decomposition Problem into Meeting PS and Without α-cycle in Functional Dependency

ZHAO Lingqiang1, HAO Zhaongxiao1,2,3, GU Zhaopeng1   

  1. (1. College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080; 2. College of Computer, Qiqihar University, Qiqihar 161006; 3. College of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-05 Published:2007-05-05

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

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

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

中图分类号: