Assume a relation schema R(a, b, c, d, e, f) with primary key (a, b) and the following full func- tional dependencies: d→ f {a,b} → d {a,b} → f ac b→ e Write down the result of normalizing R into 3rd normal form (no explanations needed). Declare primary and foreign keys in the resulting schemas.

Assume a relation schema R(a, b, c, d, e, f) with primary key (a, b) and the following full func- tional dependencies: d→ f {a,b} → d {a,b} → f ac b→ e Write down the result of normalizing R into 3rd normal form (no explanations needed). Declare primary and foreign keys in the resulting schemas.

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

Consider the relation schema R(A, B, C, D, E, F) and the set S = {AB->C, BC->AD, D->E, C->B) of functional dependencies. Assuming that R is decomposed into the relation schemas R1(A,B), R2(B,C), R3(A,B,D,E) and R4(E,F). Use the Chase test to show if this is a lossless decomposition.
Consider a relation schema R = {A, B, C, D, E, F, G} with the following set of functional dependencies: F = {BG A, A BC, BC A, BD E, E →F, CF B} The decomposition of R into R1 =A, B, C, G), R2 = {B, D, E), R3 = {B, C, F} and R4 = {E, F} is O In 3NF but Not in BCNF. O In 3NF and in BCNF. O Not in 3NF and Not in BCNF O In BCNF but Not in 3NF.
Assume a relation schema R(a, b, c, d, e, f) with primary key (a, b) and the following full func- tional dependencies: d → f {a,b} → d {a,b} → f a → c b→ e Write down the result of normalizing R into 3rd normal form (no explanations needed). Declare primary and foreign keys in the resulting schemas. urvel I
Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E, F, G) BC -> DG CD -> F FG -> A 1. compute the closure of {ACD}+ 2. compute the closure of {F}+ 3. what are the keys of R?
Answer the given question with a proper explanation and step-by-step solution.
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.
Let R be a relation schema with set of attributes {A, B, C, D, E,G}, and F be the follow- ing set of five functional dependencies which hold on R: A → B A →C BD → E ЕС + А E → G Compute the closure of each of the following four sets of attributes with respect to F: C E, A D, BCD and ADE
Consider a relation R(A,B,C,D,E) with functional dependencies AB→C, A→D, and D→E. (a) What are the keys for R? (b) What is the closure A, that is A+ ? What is the closure AB, that is (AB)+ ?
Question 3 Consider a relation A(P, Q, R, S, T) with following functional dependencies. i. P - QR ii. R- Q iii. S-T iv. T- S Infer all possible functional dependencies, superkeys and keys.
Consider the Relation R4 = (A,C,B,D,E,F), with Functional Dependencies: A -> B, C -> D, E -> D. What is the Candidate Key for R4?
Compute the closure of the following set F of functional dependencies for relation schema R = (A, B, C, D, E). A → BC CD → E B → D E → A List the candidate keys for R.
Consider a relation R(A,B,C,D,E) with functional dependencies AB→C, A→D, and D→E. (a) What are the keys for R?(b)What is the closure A, that is A+ ? What is the closure AB, that is (AC)+ ?