Consider the relational schema R(A, B, C, D, E, G, H, I, J) and a set...

 

Transcribed Image Text:

Consider the relational schema R(A, B, C, D, E, G, H, I, J) and a set of functional dependencies F = {AI→ BC, CGI, EIBG, I → AHJ, B → I, JHI). Note that A, B, C, D, E, G, H, I, J are attributes. 1. Find a minimal cover Fm for F. Please justify your answer. (3 marks) 2. Compute total number of the super keys of R with respect to F that are not candidate keys. Please justify your answer. (3 marks) 3. Given the smallest possible number of functional dependencies you need to delete from the minimal cover to make R satisfying 3NF. Please justify your answer. (4 marks) 4. Decompose R into BCNF based on your edited minimal cover from Question 3(a).3 (last question) and indicate a key in each of the resulting relation by underlining the attributes. Please justify your answer. (4 marks) Consider the relational schema R(A, B, C, D, E, G, H, I, J) and a set of functional dependencies F = {AI→ BC, CGI, EIBG, I → AHJ, B → I, JHI). Note that A, B, C, D, E, G, H, I, J are attributes. 1. Find a minimal cover Fm for F. Please justify your answer. (3 marks) 2. Compute total number of the super keys of R with respect to F that are not candidate keys. Please justify your answer. (3 marks) 3. Given the smallest possible number of functional dependencies you need to delete from the minimal cover to make R satisfying 3NF. Please justify your answer. (4 marks) 4. Decompose R into BCNF based on your edited minimal cover from Question 3(a).3 (last question) and indicate a key in each of the resulting relation by underlining the attributes. Please justify your answer. (4 marks)

Answer rating: 100% (QA)

Consider the relational schema RA B C D E G H I J and set of functional dependencies The set of functional dependencies on the relation R is as follows FAIBCCGIEIBGIAHJBIJHI 1 The minimal cover for th... View the full answer