Currently enrolled in a database theory class, and was sick during the explanation on functional dependencies. There is no textbook for this course so I've had to make do with Google so far. I've an assignment which asks, given a relvar and a list of function dependencies, to:
Here are a couple of the problems on the assignment
a. R = ABCD, F = {AB>C, C>D, D>A}
b. R = ABCDE, F = {AB>C, C>D, D>B, D>E}
At least the keys seems like a simple process, but I've no algorithm for it! Any help is appreciated.
Well, make everything into 2 attribute tables and you have 5NF. Huuuzah!!