471 views
0 0 votes
I came across a statement that says that in BCNF, a prime attribute cannot be transitively dependent on a key.

But consider a relation R (A, B, C)

    where,   A --> ABC ,   B --> ABC ,  C --> ABC

Clearly it is in BCNF and each of A, B and C are candidate keys.     

Now A --> B and B --> C and A --> C . Thus, we can tell C(a prime attribute) is transitively dependent on A (a candidate key) !!

Where am I making mistake?

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
553
553 views
? asked Feb 21, 2025
553 views
Consider a relation R(ABCD) where {AB - CD, D - A}. Check for BCNF, and if found to be violating it's conditions, decompose and tell the candidate keys for each table.
2 2 votes
2 2 answers
4.7k
4.7k views
aditi19 asked Apr 14, 2019
4,651 views
Decompose into BCNFR(A, B, C, D, E)FD: AB->C, C->D, D>B, D->E
2 2 votes
1 1 answer
3.0k
3.0k views
Na462 asked Jul 14, 2018
3,024 views
2 2 votes
1 1 answer
2.4k
2.4k views
pradeepchaudhary asked Jun 8, 2018
2,355 views
Given: The Relation R(A,B,C,D,E) having (A,B) as Primary key. The set of functional dependencies: (A,C) >D , (B,D) >E. I want to Know whether the functional dependencies ...