Professional Documents
Culture Documents
DBMS Chap 3
DBMS Chap 3
In DBMS,
Two different sets of functional dependencies for a given relation may or may not be
equivalent.
If F and G are the two sets of functional dependencies, then following 3 cases are
possible-
Case-01: F covers G (F ⊇ G)
Case-02: G covers F (G ⊇ F)
Case-03: Both F and G cover each other (F = G)
Step-01:
Step-02:
Step-03:
Step-01:
Step-02:
Step-03:
Set F-
A→C
AC → D
E → AD
E→H
Set G-
A → CD
E → AH
Solution-
Step-01:
Step-03:
Step-01:
Step-02:
Step-03: