J4 ›› 2013, Vol. 12 ›› Issue (10): 9-13.

Previous Articles     Next Articles

Application of Matlab in Replacement Algorithm for Finding All Candidate Keys

  

  1. College of Mathematics and Computer , Dali University, Dali, Yunnan 671003，China
  • Received:2013-03-12 Revised:2013-03-22 Online:2013-10-15 Published:2013-10-15

PDF (PC)

394

Abstract:

The candidate keys play an important role in the decomposition process and normalization process for relational schema. In　the paper, a replacing algorithm for finding all candidate keys of relational schema R (U, F) has been implemented in Matlab. Finally, it　was verified by the example that was complied and simulated in Matlab. The result of simulation is easier to understand and show the　speediness, efficiency, correctness of the M-functions.

Key words: Matlab, relational schema, closure of attributes set, candidate keys

CLC Number: