Application of Matlab in Replacement Algorithm for Finding All Candidate Keys
WU Rongha · Dali Xueyuan xuebao · 2013
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.