Consider the following set of functional dependencies defined over the relation schema R(A, B, C, D, E, F, G, H).
F = {AB → C, C → A, B → CFH, E → A, F → EG}
How many candidate keys does the relation R have?
1
6
2
5
3
3
4
1
5
Question Not Attempted
Consider the following set of functional dependencies defined over the relation schema R(A, B, C, D, E, F, G, H).
F = {AB → C, C → A, B → CFH, E → A, F → EG}
How many candidate keys does the relation R have?