Consider a relation with schema S(A, B, C, D) with FD's A-t B, B -t C, and B ___.D. a) What are all the non trivial FDs that follow from the given FD's? You should restrict yourself to FD's with single attributes on the right side. b) What are all the keys of R? c) What are all the superkeys for R that are not keys?
Below are two relations. Each relation has a corresponding set of FDs that hold in the relation. For each relation and corresponding FDs. answer these three questions: (i) What are all the nontrivial FDs that follow from the given FDs? List each FD with a single attribute on the right side. (ii) What are the keys of the relation? (iii) What are the superkeys for the relation that are not keys? Schemas and FDs: (a) R(A, B, C, D) with...
please do question 4.
Note that we follow the convention of denoting the set of attributes {A, B, C} by ABC when we write FDs but not when we write schemas. Given the following set set F of FDs on schema R= (A, B, C, D, E,G): A + BC AB + CD B +C E →D G +C EG → AD Answer the following questions. Questions 1-4 require a formal proof or disproof. A proof may be given either...
Question 1: Functional Dependencies [7 marks Consider a relation R on attributes (A, B, C, D, E, F,G, H) and the following functional dependen- cies. B →G C →D DE →GC → EF DEF → H (a) What is the closure of [F, G, Hy? (b) List all of the candidate keys of R under the dependencies above. (c) List all of the FDs above that are 3NF violations (d) List all of the FDs above that are BCNF violations....
For the relation R(A,B,C,D,E) with the following FDs: A → B, C → D, AB → C, BC → A 1. List all non-trivial FDs following from the above. (2 marks) 2. Generate all possible keys for R. (2 marks) 3. Check whether R is in BCNF. If it is in BCNF, explain the criteria you used. If it is not in BCNF, convert it into BCNF, showing the new relations and their FDs. (5 marks)
2. (15 points) Consider a relation with schema R(A,B,C,D) and FD= { AB->C, C->D, D- >A), what are the keys of R? Hint: Consider the 15 possible non-empty subsets of attributes. First check if a set of attributes X in R is a super key of R. If X-> R then X is superkey of R. Then X is a super key and no subset of X is a super key, then X is a key - a minimum super...
This question is from the
subject: Database Systems
QUESTION 8 Consider the relation R(A,B,C,D,E,F) with FDs A -> C,B->D, C-> E, D -> F. Consider the BCNF status of R. Which of the following could be correct given the information above? 1. Ris in BCNF already. 2. Ris not in BCNF. It must be divided into R1(A,C,E) with FDs A->C, C-> E, and R2(B,D,F) with FDs B -> D, D -> F. 3. R is not in BCNF. It must...
Consider the following FD set on a relation E with six attributes: F, R, I, D, A, and Y. YI FI D A F D R DR A Its candidate keys are [(YF), (YD), (YA)} Tasks: 1. List prime attributes and non-prime attributes for the relation E. Justify your answer. 2. Classify each functional dependence for the relation E. Justify your answer. 3. Determine the normal form of the relation E. Justify your answer.
Consider the following FD set on...
Consider the following relations for course-enrollment database in a university: STUDENT(S-ID,S-Name, Department, Birth-date) COURSE(C-ID, C-Name, Department) ENROLL(S-ID, C-ID, Grade) TEXTBOOK(B-ISBN, B-Title, Publisher, Author) BOOK-ADOPTION(C-ID, B-ISBN) (a) Draw the database relational schema and show the primary keys and referential integrity constraints on the schema. (b) How many superkeys does the relation TEXTBOOK have? List ALL of them. (c) Now assume each COURSE has distinct C-Name. (i) If C-ID is a primary key, what are the candidate keys and the unique keys...
Here is an instance of a relation R(A,B,C,D): Please just explain the feedback so I can attempt to solve it on my own! A B C D 1 2 3 4 1 3 3 3 1 3 3 4 1 2 3 3 2 2 4 4 2 4 2 4 2 4 4 4 2 2 2 4 Which of the following multivalued dependencies does this instance of R satisfy? A->> B BD ->> C D ->> AB B->>...