| FD环境下满足PS及无α环模式分解问题研究 |
| |
| 引用本文： | 赵龄强,郝忠孝,,顾照鹏.FD环境下满足PS及无α环模式分解问题研究[J].计算机工程,2007,33(9):76-78. |
| |
| 作者姓名： | 赵龄强 郝忠孝 顾照鹏 |
| |
| 作者单位： | [1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080 [2]齐齐哈尔大学计算机学院,齐齐哈尔161006 [3]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 |
| |
| 摘 要： | 通过分析在FD集F的最小归并依赖集存在弱左部或弱右部冲突时所具有的性质和特征，讨论并给出了满足PS(保持FD，无损连接且满足SNF)且无α环分解的充要条件和算法，对算法的正确性、可终止性进行了证明，并对算法的时间复杂度给出了分析。
|
| 关 键 词： | 无内部冲突 分解算法 无α环 简单范式 |
| 文章编号： | 1000-3428（2007）09-0076-03 |
| 修稿时间： | 2006-11-07 |
Research of Schema Decomposition Problem into Meeting PS and Without α-cycle in Functional Dependency |
| |
| ZHAO Lingqiang,HAO Zhaongxiao,GU Zhaopeng.Research of Schema Decomposition Problem into Meeting PS and Without α-cycle in Functional Dependency[J].Computer Engineering,2007,33(9):76-78. |
| |
| Authors: | ZHAO Lingqiang HAO Zhaongxiao GU Zhaopeng |
| |
| Affiliation: | 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 |
| |
| 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. |
| |
| Keywords: | Without inside conflict Decomposition algorithm α-acyclic Simple normal form |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
