53 53 votes Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $$\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \{K, L\}, \\ \{K\} \to \{M\}, \{L\} \to \{N\}\right\}$$ on $R$. What is the key for $R$? $\{E, F\}$ $\{E, F, H\}$ $\{E, F, H, K, L\}$ $\{E\}$ Databases gatecse-2014-set1 databases database-normalization normal + – go_editor 15.2k views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Show 3 previous comments js__ commented Dec 11, 2025 reply Follow flag check by putting the options 0 0 replyShare Raj_Dev_Verma commented Aug 24 reply Follow flag Option B is correct 0 0 replyShare nobodysomebody commented 17 hours ago reply Follow flag A simple analogy to understand why Option C is incorrect and B is correct, Both of them are able to derive all the attributes i agree on this completely but the question specifically asked for key which mean candidate key.You can think of it like candidate key is the minimal and optimal way of doing things. The option C is correct but its more of a brute force method , where as key is like a optimal approach for it. 0 0 replyShare Please log in or register to add a comment.
Best answer 57 57 votes Since $E,F,H$ cannot be derived from anything else $E,F,H$ should be there in key. Using Find $\{EFH\}^+,$ it contains all the attributes of the relation. Hence, it is key. Correct Answer: $B$ Sankaranarayanan P.N answered Sep 29, 2014 • edited May 19, 2019 by Naveen Kumar 3 Sankaranarayanan P.N comment Share Follow See all 7 Comments 7 7 Comments reply Show 4 previous comments Soumya29 commented Oct 7, 2017 i edited by Soumya29 Oct 7, 2017 reply Follow flag Really awesome way of finding keys. Must watch. Check this 3 3 replyShare Syedarshadali commented Jan 14, 2018 reply Follow flag Sir EFH must be in the key 0 0 replyShare Subarna Das commented Oct 22, 2018 reply Follow flag $\{E,F,H\}$ can be determine every attributes of the relation, but $\{E,F,H\}$ cannot be determined by any other attributes, hence, $\{E,F,H\}$ is the primary key 1 1 replyShare Please log in or register to add a comment.
12 12 votes A) {EF}+ = {EFGIJ} ≠ R(The given relation) B) {EFH}+ = {EFGHIJKLMN} = R (Correct since each member of the given relation is determined) C) {EFHKL}+ = {EFGHIJKLMN} = R (Not correct although each member of the given relation can be determined but it is not minimal, since by the definition of Candidate key it should be minimal Super Key) D) {E}+ = {E} ≠ R Regina Phalange answered Apr 6, 2017 Regina Phalange comment Share Follow 0 reply Please log in or register to add a comment.
4 4 votes Any question related to functional dependencies can be solved by a simple method: just look at the right side of all functional dependencies and note which attributes are not present at the right-hand side. Then the candidate key is definitely going to contain them because they can't be derived from the other.Now find out the closure and check the options. If They are talking about key, they mean to say CANDIDATE KEY for this question:- EFH is not present at right side so definitely the candidate key is going to contain them. closure (EFH) = EFGHIJKLMN So The correct option is B. ambikesh answered Nov 12, 2018 ambikesh comment Share Follow 0 reply Please log in or register to add a comment.
3 3 votes this is my answer. Hira Thakur answered Oct 7, 2017 Hira Thakur comment Share Follow See all 3 Comments 3 3 Comments reply set2018 commented Oct 9, 2017 reply Follow flag m confused between commas in LHS part .{E,F,H} why we are taking as whole {EFH} ? 0 0 replyShare set2018 commented Oct 9, 2017 reply Follow flag CAN WE APPLY UNION RULE FOR COMBINING {E,F,H} 0 0 replyShare Hira Thakur commented Oct 10, 2017 reply Follow flag my solution is based on given option that's why I take EFH as the combination. take a closer set of EFH you get all the attribute. 0 0 replyShare Please log in or register to add a comment.