Directed Graph Representation of Functional Dependency Set and Its Application in Teaching
Xun Wang · Computer Era · 2010
Directed graph is used to represent functional dependency set, which makes computing the closure of attribute set become directed graph traversal problem. On this basis, the solution for computing candidate key and canonical cover is proposed. The teaching practice demonstrates that the above method provides graphical means for the related contents teaching, facilitates students understanding new teaching contents and implementing the related algorithms by using data structure knowledge.