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.
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.
A Method of Candidate Key Solution in the Relational Database Base on Attribute Reduction
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.
DownLoad: