2.Given the scheme R= (ABCDEF), and following set of functional dependencies:
F = (AB®C, C®A, BC®D, ACD®B, D®EF, BE®C, CF®BD, CE
, ACD®B, D®EF, BE®C, CF®BD, CE ®AF).
(a) Find (BD)+
(b) Find (AB)+
(c) Find Candidate Keys for R
Given the scheme R= (ABC), and following set of functional dependencies:
F = (A®BC, B® AC, C ® AB).
(a) Find closure (BC, F)
(b) Find at least one candidate key for R.
(c) Find at least one super-key for R which is not the same as your answer in
(d) Find at least one minimal cover for a relational scheme (ABC). Show work.
(e) Provide a 3NF decomposition for R.
Consider the following set of FDs:
F = (A ® B, AB ® C, D ® AC, D ® E)
G = (A ® BC, D ® AE)
H = (A ® BC, B ® C, A ® B, AB ® C, AC ® D).
(a) Is F ≡ G? Show your work.
(b) Find the minimal cover for H. Show work.