15,215 views
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$?

  1. $\{E, F\}$
  2. $\{E, F, H\}$
  3. $\{E, F, H, K, L\}$
  4. $\{E\}$

4 Answers

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$
• edited by
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

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.

3 3 votes

this is my answer.

Answer:
Position:
Show:

Related questions

78 78 votes
11 answers 11 answers
33.6k
33.6k views
go_editor asked Sep 28, 2014
33,606 views
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
63 63 votes
5 answers 5 answers
22.1k
22.1k views
go_editor asked Sep 26, 2014
22,114 views
Given the following two statements: S1: Every table with two single-valued attributes is in $\text{1NF, 2NF, 3NF}$ and $\text{BCNF}.$ S2: $AB \to C, D \to E, E \to C$ is ...
68 68 votes
6 answers 6 answers
23.3k
23.3k views
go_editor asked Sep 28, 2014
23,291 views
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id)You wan...
37 37 votes
4 answers 4 answers
14.9k
14.9k views
go_editor asked Sep 26, 2014
14,928 views
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectiv...