Let R(A,B,C,D,E,F,G) be a relation with the FDs: F= (CDG, DG-C, AD-G, G-A, AB-F). Consider the decomposition of R into R1(C, D, G), R2(A, D, G), R3(AB, F) and R4(C, E). Which of the following statements is TRUE about this decomposition? Select one: R is Not in 3NF and Not in BCNF. R is in BCNF but Not in 3NF. R is in 3NF but Not in BCNF R is in 3NF and in BCNF.

Let R(A,B,C,D,E,F,G) be a relation with the FDs: F= (CDG, DG-C, AD-G, G-A, AB-F). Consider the decomposition of R into R1(C, D, G), R2(A, D, G), R3(AB, F) and R4(C, E). Which of the following statements is TRUE about this decomposition? Select one: R is Not in 3NF and Not in BCNF. R is in BCNF but Not in 3NF. R is in 3NF but Not in BCNF R is in 3NF and in BCNF.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose relations R(A,B) and S(B,C,D) are as follows
Give a BCNF decomposition to relation "r" according to the given functional dependencies. Show the steps of normalization clearly to get full credit. r(U, V, W, X, Y, Z) Z-> XY X -> VW V-> U XY -> Y
You are given a relation R with the following attributes R(A,B,C,D,E). Assume that you were given the following functional dependencies: • FD1= AB -> E • FD2: = D -> C (a) What is a valid key for this relation? justify your response. (b) Is this relation in 3NF (Third Normal Form)? Justify your response. If it is not in 3NF, normalize the relation and demonstrate all steps of normalization.
Let R(ABCDEFG) be a relation and F={A -> C, A-> D, B->F, E->F, F->G} a. Show example of lossless join decomposition of R into three tables R1, R2 and R3 and demonstrate that this decomposition is lossless using chase algorithm b. Find one key for this scheme and prove that it is a key using closure algorithm and definition of a key.
Consider the relation R with the following functional dependencies: R(P,Q,R,D,E,F) FD = {P →Q,QR → D,E → R, D → P} Which of the following are the candidate keys? (a) PF, QF. (b) PF, QF, RF (c) PEF, QEF, DEF (d) PEF, QFR
Given the following relation: R(A, B, C, D, E, F, G) The functional dependencies that apply onto R are: AB> G B>E,F G>A A> CD 1. What normal form is the relation in? Why? 2. How would you successively normalize it completely? State the reason behind each decomposition step by step.
39 of 40 Let R = (A, B, C, D) be a relation schema with the FD's: A → B and B → A. R has how many superkeys? (Write your answer as an integer). write your answer here
For relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E) C D → B A → D E → C 1. Decompose the above relation using the Boyce-Codd Normal Form (BCNF) decomposition. 2. What is the key for the relation R?
quickly Please
Assume that the advisor connection is one-to-one. What additional restrictions do you need on the relation advisor to implement the one-to-one cardinality constraint?
1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.
Suppose you are given a relation grade_points(grade, points) that provides a conversion from letter grades in the takes relation to numeric scores; for example, an “A” grade could be specified to correspond to 4 points, an “A−” to 3.7 points, a “B+” to 3.3 points, a “B” to 3 points, and so on. The grade points earned by a student for a course offering (section) is defined as the number of credits for the course multiplied by the numeric points for the grade that the student received.Given the preceding relation, and our university schema, write each of thefollowing queries in SQL. You may assume for simplicity that no takes tuple has the null value for grade. Find the ID and the grade-point average of each student.