|
|||||
|
|
| 基于闭包的关系模式全部主属性的多项式时间算法 | |
| 引用本文： | 张家明. 基于闭包的关系模式全部主属性的多项式时间算法[J]. 计算机研究与发展, 1998, 35(4): 296-300 |
| 作者姓名： | 张家明 |
| 作者单位： | 东南大学自动控制系 |
| 摘 要： | 文中通过对关系模式中的属性进行适当的分类，讨论了一个属性成为主属性应该满足的条件，并在文献「４」、「５」「６」的基础上，采用闭包，实现了利用Ａｒｍｓｔｒｏｎｇ公理进行函数信赖推导的过程，从而给出了一个简便的求解关系模式全部主属性的多项式时间算法。 |
| 关 键 词： | 主属性 关系模式 多项式 时间算法 数据库 |
A POLYNOMIAL TIME ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE CLOSURE |
|
| Zhang Jiaming,Qi Jin,Zhou Boxin,and Song Wenzhong. A POLYNOMIAL TIME ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE CLOSURE[J]. Journal of Computer Research and Development, 1998, 35(4): 296-300 | |
| Authors: | Zhang Jiaming Qi Jin Zhou Boxin and Song Wenzhong |
| Abstract: | The condition under which an attribute is a prime attribute is studied by classifying the attributes. The inference of functional dependencies based on Armstrong axiom is realized using the closure, and a polynomial time algorithm to find all prime attributes of a relation schema is given on the basis of the related references . |
| Keywords: | prime attribute relation schema closure |
| 本文献已被 CNKI 维普 等数据库收录！ | |