Given a relation schema R(A.B.C) and its relation instance as follows: A B C 1 23...

  

Transcribed Image Text:

Given a relation schema R(A.B.C) and its relation instance as follows: A B C 1 23 4 6 6 7 2 5 2 3 2 8 7 8 595 Problem 2. Consider relation schema R(A.B.C) and the set of functional dependencies: F= {B->A, A->C}. Do the following: 1. Find the cover of F. i.e., the set of all non-trivial FDs implied by F with a single attribute on the right and a minimal left-hand side. 2. Does there exist an instance that satisfies every FD in F, but does not satisfy the FD AB->C? Give a "yes" or "no" answer. Given a relation schema R(A.B.C) and its relation instance as follows: A B C 1 23 4 6 6 7 2 5 2 3 2 8 7 8 595 Problem 2. Consider relation schema R(A.B.C) and the set of functional dependencies: F= {B->A, A->C}. Do the following: 1. Find the cover of F. i.e., the set of all non-trivial FDs implied by F with a single attribute on the right and a minimal left-hand side. 2. Does there exist an instance that satisfies every FD in F, but does not satisfy the FD AB->C? Give a "yes" or "no" answer.