Consider a relation schema R = (A, B, C, D, E, F) on which the following functional dependencies hold :
A → B B, C → D
E → C
D → A What are the candidate keys of R?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. AEF, BEF and DEF
Explanation
E and F never appear on a right side, so every key contains EF; E gives C. AEF: A → B, BC → D gives all. BEF: BC → D → A. DEF: D → A → B. So AEF, BEF and DEF.
More Database Management Systems questions
- Consider two transactions on account A (initial balance 20,000): T1 transfers 5,000 to account B, then T2 applies 10% interest to A. The lo…
- Consider the tables Students(Roll-No, Name) and Performance(Roll-No, Course, Marks) shown below; Students also contains the row (18CS103, R…
- A clustering index is defined on the fields which are of type
- In RDBMS, which type of Join returns all rows that satisfy the join condition ?
- Consider a relation book (title, price) which contains the titles and prices of different books. Assuming that no two books have the same p…
- In a Hierachical database, a hashing function is used to locate the ________.