Seeking for Relation Scheme Candidate Key by Using Functional Depending Graph
Guoming Cai · Journal of Anqing Teachers College · 2004
Seeking for candidate key of relation scheme is an important question in designing database theory. According to the graph theory, the paper firstly constructs a functional depending graph of relation scheme, then puts forth the relationship between the function depending and the candidate key. At last it provides the concrete method of seeking for algorithm for relation scheme candidate key by using both reverse adjacency list as its storing structure and BFS technology of graph.