Show that a decomposition is lossless or dependency preserving in DBMS
Show that a decomposition is lossless or dependency preserving in DBMS
suppose that we decompose a schema R(A,B,C,D,E) into (A,B,C) and (A,D,E) Show that this decomposition is lossless.If the following set of functional dependencies holds:
#aasaanpadhaai #ugcnetcs #ugcnetcomputerscience