For each of the following sets of functional dependencies on a schema r(A, B, C, D, E)
AB --> C, D --> E, B --> E
A --> CD, B --> DE
AB --> C, C --> D
For each of the above set of functional dependencies, decompose relation r into BCNF
how to decompose r into BCNF of above relation r?
how to decompose r into BCNF of above relation r?
Look at this pdf file which has an example you can used:
http://www.cs.virginia.edu/~son/662.pdffiles/662.bcnf.pdf
and look at this which has some explanation:
http://www.csee.umbc.edu/~pmundur/courses/CMSC461-06/hw4_answerkey.txt
i had found explanation link but example link is not working.
Thanks a lot..
So you haven't solve this problem for 3 months?
Closure can easily be computed by applying Amstrong's interference rules (reflexity, transitivity, augmentation). For example you may start this way:
a) A -> A (reflexivity rule)
b) A -> ACD (a + transitivity A->CD)
c) A -> ACDE (b + transitivity D->E)
d) Now it's your turn (apply the missing one :)
You already know the meaning of the result?
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.