何英, 何丹. 基于属性约简的关系数据库候选码的求解[J]. 南昌航空大学学报(自然科学版), 2010, 24(3): 27-29.
引用本文: 何英, 何丹. 基于属性约简的关系数据库候选码的求解[J]. 南昌航空大学学报(自然科学版), 2010, 24(3): 27-29.
shu
HE Ying, HE Dan. A Method of Candidate Key Solution in the Relational Database Base on Attribute Reduction[J]. Journal of nanchang hangkong university(Natural science edition), 2010, 24(3): 27-29.
Citation: HE Ying, HE Dan. A Method of Candidate Key Solution in the Relational Database Base on Attribute Reduction[J]. Journal of nanchang hangkong university(Natural science edition), 2010, 24(3): 27-29.
shu

基于属性约简的关系数据库候选码的求解

A Method of Candidate Key Solution in the Relational Database Base on Attribute Reduction

    摘要
  • 摘要: 文章将Rough集的属性约简中的可辨别矩阵法引入关系数据库候选码的求解,该方法直接从关系系统中求解候选码,无需事先给出函数依赖集,突破了传统的候选码求解方法.

     

    Abstract: This paper introduces the discernible matrix of attribute reduction of rough set to the relational database candidate code solution.This method can directly obtain candidate key from relational database,which does not need functional dependency set.So it gives a different way and idea to get candidate key.

     

    • HTML全文
    • 参考文献(3)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回