ZHOU Dingkang. An Algorithm for Solving All Candidate Keys of Relation Schema Based on the Treppeniteration StructureJ. Journal of Computer Research and Development, 1993, 30(12): 31-35.
Citation:
ZHOU Dingkang. An Algorithm for Solving All Candidate Keys of Relation Schema Based on the Treppeniteration StructureJ. Journal of Computer Research and Development, 1993, 30(12): 31-35.
ZHOU Dingkang. An Algorithm for Solving All Candidate Keys of Relation Schema Based on the Treppeniteration StructureJ. Journal of Computer Research and Development, 1993, 30(12): 31-35.
Citation:
ZHOU Dingkang. An Algorithm for Solving All Candidate Keys of Relation Schema Based on the Treppeniteration StructureJ. Journal of Computer Research and Development, 1993, 30(12): 31-35.
An Algorithm for Solving All Candidate Keys of Relation Schema Based on the Treppeniteration Structure
In this paper,we define the conception of strong primary attribute and discuss the treppeniteration structure of the attribute subset.A new algorithm for solving all candidate keys of relation schema is found.
DownLoad: