• edited by
20,451 views
46 46 votes

Consider a relation scheme $R = (A, B, C, D, E, H)$ on which the following functional dependencies hold: {$A \rightarrow B$, $BC \rightarrow D$, $E \rightarrow C$, $D \rightarrow A$}. What are the candidate keys R?

  1. $\text{AE, BE}$
  2. $\text{AE, BE, DE}$
  3. $\text{AEH, BEH, BCH}$
  4. $\text{AEH, BEH, DEH}$

7 Answers

Answer:
Position:
Show:

Related questions

32 32 votes
3 answers 3 answers
15.5k
15.5k views
gatecse asked Sep 21, 2014
15,531 views
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is :$f(b-a)$$f(b) - f(a)$$\int\limits_a^b f(x) dx...
200 200 votes
9 answers 9 answers
79.3k
79.3k views
Kathleen asked Sep 22, 2014
79,309 views
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...
110 110 votes
6 answers 6 answers
43.9k
43.9k views
Kathleen asked Sep 22, 2014
43,906 views
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list...
49 49 votes
8 answers 8 answers
25.2k
25.2k views
Kathleen asked Sep 22, 2014
25,177 views
Which one of the following statements about normal forms is $\text{FALSE}?$$\text{BCNF}$ is stricter than $\text{3NF}$Lossless, dependency-preserving decomposition into $...