I have the following relation:
R = ABCDE F: AB->DE, AC->B, DE->C, AE->C, C->AB
I need to determine this relations candidate keys.
Now, if I understood the defintion correctly:
In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that the relation does not have two distinct tuples
The candidate keys would be: C, AB, AE, DE.
Is this correct or are there more?