• edited by
2,244 views
2 2 votes
Given a table $R(ABCDEF)$

$ABC -> D$

$ABD -> E$

$CD   ->  F$

$CDF -> B$

$BF    -> D$

It's candidate keys are $ABC, ACD.$

 So while checking for $2NF$, Can I say that $ABD -> E$ is not partially dependent because $ABD$ as a whole is not a part of candidate key even though $AB$ is a part of candidate key.

1 Answer

Position:
Show:

Related questions

4 4 votes
4 4 answers
4.4k
4.4k views
Tuhin Dutta asked May 27, 2019
4,374 views
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF
2 2 votes
1 1 answer
5.2k
5.2k views
Arjun asked Nov 5, 2017
5,225 views
Consider a relation $R (A, B, C, D, E, F, G, H)$ where each attribute is atomic, and following functional dependencies exist.$ CH \rightarrow G$$A \rightarrow BC$$B \righ...
1 1 vote
3 3 answers
2.0k
2.0k views
Arjun asked Nov 5, 2017
1,999 views
Match the following with respect to RDBMS :$\begin{array}{clcl} \text{(a)} & \text{Entity integrity} & \text{(i)} & \text{enforces some specific business rule that do not...
0 0 votes
1 1 answer
651
651 views
air1ankit asked Oct 28, 2017
651 views
Why B or B+ tree is prefer for database indexing rather than AVL tree ????