First page Back Continue Last page Overview Graphics
Milestone : Formal Statement of Problem 1
All the elements of the set F are in the form of X --> Y. Therefore, F = {X1 --> Y1, X2 --> Y2, ..., Xn --> Yn}. A new functional dependency Xn+1 --> Yn+1 is added to the set F which changes the set to F'. Since it is not necessary that the exact dependencies specified in F appear themselves in individual relations of the decomposition D. If is sufficient that the union of the dependencies that hold on the individual relations in D be equivalent to F, D must be calculated again to give D'.