The minimal cover of F is given
1. Search for dependencies in F-having the same attribute set on the left hand side
A: A->B1, A->B2, A->B3, …, A->Bk
And construct relation as (A, B1, B2, B3,…, Bk)
2. Construct a relation with remainder attributes.
3. In case none of the relations has a candidate key, then set one more with the attributes of a
candidate key.
For example
R(A, B, C, D, E, F, G)
Candidate key: AF
A -> BC
AF -> D
D -> EG
3NF decomposition
R1 (A, B, C)
R2 (A, F, D)
R3 (D, E, G)
Oh my goodness! Amazing article dude! Thank you, However I am
encountering troubles with your RSS. I don’t know
the reason why I cannot subscribe to it. Is there anybody else getting similar RSS problems?
Anybody who knows the answer will you kindly respond? Thanx!!
Hello to all, the contents existing at this web page
are truly awesome for people knowledge, well, keep up the good work
fellows.