First page Back Continue Last page Overview Graphics
Milestone : Formal Statement of Problem 2
With the addition of new functional dependencies D is recomputed to give D'. However, the query set Q = {Q1, Q2, ... , Qn}has remained the same and is based on D. For example if in D, there exists a relation R1 = {A1, A2, ..., An} and after the further decomposition we obtain D',R1 decomposes to a relation R1' = {A1', A2',..., Aj'} and relation R1'' = {A1'', A2'', ... , Ak''} such that R1 = R1' U R1'' where j ≠n and k ≠ n , this implies that in D which had a query Q1 which included attributes from the set {R1, R2, ..., Rn}, will replace it with {R1', R1'', ..., Rn', Rn''}.