You are given the following set of functional dependencies for a relation R= (A, B,C,D,E,F), F= (AB → C, DC → AE, E → F). a- What are the keys of this relation? b- Is this relation in BCNF? If not, explain why by showing one violation. c- Is the decomposition (A , B , C ,D) (B,C,D E, F) a dependency preserving decomposition? If not, explain briefly Your answer

You are given the following set of functional dependencies for a relation R= (A, B,C,D,E,F), F= (AB → C, DC → AE, E → F). a- What are the keys of this relation? b- Is this relation in BCNF? If not, explain why by showing one violation. c- Is the decomposition (A , B , C ,D) (B,C,D E, F) a dependency preserving decomposition? If not, explain briefly Your answer

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

We studied different properties of relations like reflexive, symmetric, antisymmetric, transitive. Please provide one example relation each for each property of the relation. Try to come up with original examples which can be seen practically. (Example, Reflexive relation R = {(a, b) | a and b share same birthday}, Symmetric relation R = {(a, b) | a and b are friends}, Antisymmetric relation R = {(a, b) | a is instructor of b}, Transitive relation R = {(a, c) | a is sibling of b, b is sibling of c, then a is sibling of c}
Let's suppose, a relation R=(A, B, C, D, E. H) with a set of functional dependencies F: (AE->BC, B ->AD, CD->E, E→CD, A->E) is given. Relation R (A, B, C, D, E, H) is decomposed into R1 (A, B, C, D) and R2 (A, B, E, H). Find out whether the decomposition is lossless or not, and whether it is dependency preserving or not.
Computer Science Given the relation R (A, B, C, D, E, F, G) and the set of functional dependencies: F= {BCD → A, BC → E, A → F, F→G, C→D, A→G}, a) Decompose R into 3NF. Show the different steps. b) Is this decomposition also in BCNF? Why or why not?
Suppose that we have the following four tuples in a relation S with three attributes ABC: (1,2,3), (4,2,3), (5,3,3), (5,3,4). Which of the following functional (-->) and multivalued (-->>) dependencies can you infer does not hold over relation S? a) A-->Bb) A-->>Bc) BC-->Ad) BC-->>Ae) B->Cf) B-->>C
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.
Give a set of FDs for the relation R (ABCD) with AB as primary key under which condition R is in 2NF but not in 3NF. Warning-Give correct answer , i will report and downvote you
Consider the following set F of functional dependencies on the relation schema R = (A, B, C, D, E, G,H): A→ D AB→ DE BD→ A AC→ G a) Prove ABCH and BCDH are candidate keys of R. b) Give a lossless BCNF decomposition of R based on the set of functional dependencies (No need to compute the closure). Does the decomposition preserve dependencies? Why or why not? c) Given the following canonical cover: A->D AB->E BD->A AC->G Give a lossless dependency preserving 3NF decomposition of R accordingly. Again, no need to compute the closure.
Consider a relation schema R(A, B, C, D, E, G) and a set of functional dependencies F = {A → C, AD → CE, B → ACD, C → B}. (a) Show the steps of computing a canonical cover for F. (b) Compute the closure of AG and then determine whether or not AG is a candidate key. (c) Determine whether or not (A, E, G) is in BCNF and justify your answer using the transitive closure of a set of attributes. If (A, E, G) is not in BCNF, find a BCNF decomposition of it. (d) Assume that (A, E, G) is decomposed into (A, G) and (E, G). Given the above functional dependencies, is this decomposition always lossless? If so, prove this. Otherwise, explain it using an example (i.e., a case of decomposing a table containg rows and columns into two tables). (e) Assume that R is decomposed into R1(A, B, C, D) and R2(A, E, G). Is this decomposition dependency preserving? Justify your answer.
Consider a relation with schema R(A,B,C,D,E,G) and functional dependencies (FDs) C→D; B→A; D→E; E→G ) What is the closure of {B,C}? Show steps of your solution. Find 2 nontrivial FDs that can be inferred from the given FDs set. Explain how you found them. Propose one key for a given schema and FDs. Explain how you found it.
It is possible to construct a connection such as sec course from a group of relationships that are many to one. Does the relation's many-to-one cardinality restriction get enforced by the main and foreign key constraints? Why do you think that is?
Define a relation on Z by aRb if and only if a divides b. Is R an equivalnce relation? Why or why not?
Consider the relation R(O,P,X,Y,E, S); FDs={ O=P, XY=O, OE=S, EY=X, PY=X} What is the dependency preservation property for a decomposition? Why is it important? Decompose the relation into BCNF relation. What is the lossless (or nonadditive) join property of a decomposition? Why is it important? Determine whether each of the decompositions has the lossless join property with respect to F and conclude for the whole decomposition Determine whether each of the decompositions has the dependency preserving property with respect to FD and conclude for the whole decomposition