Consider the following definition of equivalent sets of functional dependencies on a
relation:
“Two sets of functional dependencies F and F’ on a relation R are
equivalent if all FD’s
in F’ follow from the ones in F, and all the FD’s in F follow from the ones in F’.” Given a relation R(A, B, C) with the following sets of functional dependencies:
F1 = {A B, B C},
F2 = {A B, A C}, and
F3 = {A B, AB C}:
[a] Are F1 and F3 equivalent? If so, prove that all FD’s in F1 follow from the ones in F3, and vice-versa. If not, give a counterexample by showing an instance (set of tuples) of R such that the FD’s in one of the sets all hold, while some FD in the other set does not hold.
[b] Are F2 and F3 equivalent? If so, prove that all FD’s in F2 follow from the ones in F3, and vice-versa. If not, give a counterexample by showing an instance (set of tuples) of R such that the FD’s in one of the sets all hold, while some FD in the other set does not hold.
[c] Does the given definition of functional dependency equivalence imply that two sets of functional dependencies on a relation are equivalent if and only if the keys of the relation due to each set are identical? Explain your answer.
Given sets of functional dependencies are:
F1 = {A B, B C},
F2 = {A B, A C}, and
F3 = {A B, AB C}:
[a]
Solution :
Step 1 : Take Set F1 and Check F3 is covered from F1 or not.
(A)+ = {B}
(A)+ = {BC}
A → B covered. But AB-->C not coverd.
⇒ F3 is not derived from F1. Hence F3 is not covered by F1.
Step 2 : Take Set F3 and Check F1 is covered from F3 or not.
(A)+ = {B}
(AC)+ = {BC}
(E)+ = {ABC}
F1 = {A B, B C} is covered.
⇒ F1 is derived from F3. Hence F1 is covered from F3.
Since F3 is not derived from F1, F1 and F3 are not equivalent.
[b]Solution :
Step 1 : Take Set F2 and Check F3 is covered from F1 or not.
(A)+ = {B}
(A)+ = {AC}
A → B covered. But AB-->C not coverd.
⇒ F3 is not derived from F1. Hence F3is not covered by F1.
Step 2 : Take Set F3 and Check F2 is covered from F3 or not.
(A)+ = {B}
(AC)+ = {BC}
(E)+ = {ABC}
F1 = {A B, B C} is covered.
⇒ F1 is derived from F3. Hence F1 is covered from F3.
Since F3 is not derived from F1, F1 and F3 are not equivalent.
Consider the following definition of equivalent sets of functional dependencies on a relation: “Two sets of...
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
Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold over this relation. F=D → C, A B,A-C Question 4.1 (3 Points) Determine all candidate keys of R Question 4.2 (4 Points) Compute the attribute cover of X-(C, B) according to F Question 43 (5 Points) Compute the canonical cover of F.Show each step of the generation according to the algorithm shown in class....
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.
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 following relation R(A,B,C,D,E,G) and the set of functional dependencies F = { A → BCD BC → DE B → D D → A} Give a 3NF decomposition of the given schema based on a canonical cover
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...
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.
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....
1. Consider the relation PatientOf and the functional dependencies below. Describe, with examples, how redundancy, update, and delete anomalies can arise. PatientOf (patient_no, name, address, doctor_no, since) patient_no → name, address patient_no, doctor_no → since 2. Consider a relation with attributes R(A, B, C, D, E) that satisfies the following functional dependencies: AB → D AC → E BC → D D → A E → B Find all the keys that contain the attribute A.
Consider the following relation R= {A, B, C, D, E} and the following set of functional dependencies F={ A → BC CD → E B + D E + A} Give a lossless, dependency-preserving decomposition into 3NF of schema R