Finding Candidate Keys from Functional Dependencies
It is to find the Candidate Keys of a Relation with a given set of Functional Dependencies. This lecture is on Relational Database Systems. This lecture will help to solve questions when given a Relational Schema with a set of Functional Dependencies, it is to determine all the Candidate Keys in R. After going through the lesson, and with little practice you will be able to solve similar questions. A relation R={A,B,C,D,E,F,G} is given with set of FDs F={AD E, BE F, B C, AF G} Find the Candidate Keys in R.