minimal cover for functional dependencies
Posted
by
user2975836
on Stack Overflow
See other posts from Stack Overflow
or by user2975836
Published on 2013-11-10T09:50:42Z
Indexed on
2013/11/10
9:53 UTC
Read the original article
Hit count: 224
I have the following problem:
AB -> CD
H->B
G ->DA
CD-> EF
A -> HJ
J>G
I understand the first step (break down right hand side) and get the following results:
AB -> C
AB -> D
H -> B
G -> D
G -> A
CD -> E
CD -> F
A -> H
A -> J
J -> G
I understand that A -> h and h -> b, therefore I can remove the B from AB -> c and ab -> D, to get:
A -> C
A -> D
H -> B
G -> D
G -> A
CD -> E
CD -> F
A -> H
A -> J
J -> G
The step that follows is what I can't compute (reduce the left hand side)
Any help will be greatly appreciated.
© Stack Overflow or respective owner