International Association of Engineering and Management Education (IAEME)
In this paper, a simple straightforward method to find all the candidate keys of a relational database schemes using graph is presented. First, the FD graph is drawn from the set of functional dependencies in a relational scheme. Thereafter, by using few very simple graph transformations, the FDG is reduced to a graph called the candidate graph having only the candidate nodes. From this candidate Graph, all the candidate keys for the relational scheme can be identified.