Finding keys of given relation R(A,B,C,D) BY checking all subsets of attributes
2. (15 points) Consider a relation with schema R(A,B,C,D) and FD= { AB->C, C->D, D- >A),...
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 relation: R(A,B,C,D,E) The following set of functional dependencies are ture on the relation R: FD: AB -> E, E -> D, AD -> C Which of the following sets of attributes does not functionally determine C? AC ABE BD AE AB
Given the following Schema S = (R, FD) where R = (A, B, C, D, E, F) and FD contains the following dependencies: A -> BC B ->C C -> D D ->E C -> E E -> F DE -> F C -> F 1. Find a minimal cover of F 2. Find a key for the schema 3. Find a 3N decomposition of the schema that satisfies the lossless join decomposition and dependency preservation properties 4. Find a...
For the following relation schema and set of FD's R(A,B,C,D) with FD's AB->C, B->D, CD->A, AD->B Indicate the BCNF violations, and decompose the relations into relations that are in BCNF.
Consider the relation R(A, B, C, D, E), where it is known that the only keys are {A, C, D} and {D, E}: Give a set of functional dependencies that will make {A, C, D} and {D, E} be the only keys of R. This set should be such that if you delete any FD, then the keys of R will be something other than {A, C, D} and {D, E}.
Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E) C D → B A → D D → C E → C What is the closure of AB ({AB}+)? What is the closure of F (F+)? [ set of closures for all LHS][each LHS on one line] What is the minimal set (cover) for F? Provide a key for relation R (a minimal set of attributes that can determine all attr.) Decompose the...
Consider the relation R with attributes: A, B, C, D, E, and F Let S be a set of functional dependencies in R such that S = { A-> B, CD-> E, C-> D]. Which of these attributes are in the closure of [C, F)?
Consider a relation R(A, B, C, D) with the functional dependencies {AB → C, C → D, D → A}. Does BC → A hold on R? Explain. show steps.
Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd Normal Form (BCNF) violations'? (c) Give a decomposition of R into BCNF based on the given functional dependencies. (d) Give a different decomposition of R into BCNF based on the given functional dependencies. (e) Give a decomposition of R into 3NF based on the given functional dependencies.
Consider a relation R with ve attributes A, B, C, D, and E. You are given the following functional dependencies: A->B, BC->E, and ED->A. (a) List all keys for R. (10 points) (b) Is R in BCNF? If it is, explain why. If is not, decompose it into a collection of BCNF relations. (20 points) (c) Is R in 3NF? If it is, explain why. If it is not, convert it into a collection of 3NF relations. (20 points)