Help ASAP! 1. (10 pts) Given a relation schema R = (A, B, C, D, G,...
Help ASAP!
1. (10 pts) Given a relation schema R = (A, B, C, D, G, H) and a
set of functional dependencies F = {D -> G, CD -> G, D ->
C, H -> G}
Find FC, a canonical cover of F. Please show all the steps to
get your answer.
2. (30 pts) A Hollywood movie studio uses a relation called Movie
to keep track of information about movie stars, what fee a star
charges for appearing in a movie, movies the star has appeared in,
and agents. The scheme of Movie is:
Movie-scheme = (star_name, star_address, fee, title, year, length,
agent, agent_address)
The set of dependencies on Movie-scheme is:
F = { star_name -> {fee, agent, agent_address},
{star_name, title} -> fee,
{title, year} -> length,
agent -> agent_address}
(1) Give a decomposition of Movie-scheme into BCNF. Show your work,
and justify that each of your new schemes is in BCNF. Do NOT do
unnecessary decompositions - if a scheme is in BCNF, you should not
decompose it any further.
(2) Is the original Movie-scheme in 3NF? Why or why not? If not, give a lossless-join decomposition of Movie-scheme into 3NF. Show your work.
Homework Answers
Add Answer to:
Help ASAP!
1. (10 pts) Given a relation schema R = (A, B, C, D, G,...
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 o...
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 the following relation R(A,B,C,D,E,G) and the set of functional dependencies F = { A →...
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 schema R with attributes ABCDEFGH with functional dependencies S: S={B→CD, BF→H, C→AG, CEH→F,...
Consider a relation schema R with attributes ABCDEFGH with functional dependencies S: S={B→CD, BF→H, C→AG, CEH→F, CH→B} Employ the BCNF decomposition algorithm to obtain a lossless decomposition of R into a collection of relations that are in BCNF. Make sure it is clear which relations are in the final decomposition and project the dependencies onto each relation in that final decomposition.
Consider the following relation R= {A, B, C, D, E} and the following set of functional...
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
consider the schema R-(A,B.C,D,E) and the following set F of functional dependencies holds on R ABC...
consider the schema R-(A,B.C,D,E) and the following set F of functional dependencies holds on R ABC CD-E B- D E-A Problem 2. Suppose that we decompose the relation schema R into R, -(A, B, C) and R, (C, D,E). Show that this decomposition is not a lossless-join decomposition.
Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b-...
Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b- R(A,B,C,D) F={BẠC, BD, AD>B} C- R(A,B,C,D) F={AB-C, DC+D, CD+A, AD+B} d- R(A,B,C,D) F={AB=C, C+D, D™B, DE} e- R(A, B, C, D, E) F= {AB+C, DB+E, AE>B, CD+A, ECD} In each case, (i) Give all candidate keys (ii) Indicate the BCNF violation Give the minimal cover and decompose R into a collection of relations that are BCNF. Is it lossless? Does it preserve the dependencies?...
Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume...
Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume that the following set of functional dependencies holds on R: The letters can be interpreted as follows: R=(Model_Number. Year, Price, Manufacturing Plant Color). 1. [25 points] Give a lossless.join decomposition of Rinto Boyce-Codd normal form. Make sure to use the algorithm studied in class (Figure 7.11, page 331 of the book) and to show all details. 2. [25 points] Does your decomposition preserve functional dependencies? Justify your...
Normalisation Consider the following relation schema about project meetings: PMG(projID, title, type, manager, jobID, start-date, end-date,...
Normalisation Consider the following relation schema about project meetings: PMG(projID, title, type, manager, jobID, start-date, end-date, contractor, contractNo) Some notes on the semantics of attributes are as follows: • Each project has a unique project ID (projID) and also has a title, type and manager. Each manager has a specialty project type. • A project often contracts jobs to contractors with start-date and end-date. Contracts are identified by contract numbers (contractNo), but contract details are out of the scope of...
my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a...
my choices for these are wrong.
10 points QUESTION 3 Given R=(A, B, C) is a schema and F = {2C-A AB) is a set of FDs that hold on R. Which of the following statements is not true? d=(AB. AC) is a decomposition of that is in BCNF. O Ris in 3NF O BC is a candidate key for R Ris in BCN 10 points QUESTION 4 Given R= (A. 3. CD. E) is a schema and F= (A...
Q3: Given a relational schema R = {A,B,C,D,E,F,G,H,1,J,K} and a set of functional dependencies F {A...
Q3: Given a relational schema R = {A,B,C,D,E,F,G,H,1,J,K} and a set of functional dependencies F {A B C D E, E F G H I J,AI →K} and a key(R) = AI = 1. Is R in BCNF? If yes, justify your answer [5 points] 2. If no, explain why and decompose R for two levels only [10 points] 3. Check whether the decomposition in step 2 dependency preserved or not [5 points]
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 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
consider the schema R-(A,B.C,D,E) and the following set F of functional dependencies holds on R ABC CD-E B- D E-A Problem 2. Suppose that we decompose the relation schema R into R, -(A, B, C) and R, (C, D,E). Show that this decomposition is not a lossless-join decomposition.
Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b- R(A,B,C,D) F={BẠC, BD, AD>B} C- R(A,B,C,D) F={AB-C, DC+D, CD+A, AD+B} d- R(A,B,C,D) F={AB=C, C+D, D™B, DE} e- R(A, B, C, D, E) F= {AB+C, DB+E, AE>B, CD+A, ECD} In each case, (i) Give all candidate keys (ii) Indicate the BCNF violation Give the minimal cover and decompose R into a collection of relations that are BCNF. Is it lossless? Does it preserve the dependencies?...
Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume that the following set of functional dependencies holds on R: The letters can be interpreted as follows: R=(Model_Number. Year, Price, Manufacturing Plant Color). 1. [25 points] Give a lossless.join decomposition of Rinto Boyce-Codd normal form. Make sure to use the algorithm studied in class (Figure 7.11, page 331 of the book) and to show all details. 2. [25 points] Does your decomposition preserve functional dependencies? Justify your...
my choices for these are wrong.
10 points QUESTION 3 Given R=(A, B, C) is a schema and F = {2C-A AB) is a set of FDs that hold on R. Which of the following statements is not true? d=(AB. AC) is a decomposition of that is in BCNF. O Ris in 3NF O BC is a candidate key for R Ris in BCN 10 points QUESTION 4 Given R= (A. 3. CD. E) is a schema and F= (A...
Q3: Given a relational schema R = {A,B,C,D,E,F,G,H,1,J,K} and a set of functional dependencies F {A B C D E, E F G H I J,AI →K} and a key(R) = AI = 1. Is R in BCNF? If yes, justify your answer [5 points] 2. If no, explain why and decompose R for two levels only [10 points] 3. Check whether the decomposition in step 2 dependency preserved or not [5 points]
Most questions answered within 3 hours.
-
Add 1ml of 0.18M of HCl (aq) to 1ml of 0.2M of [Ag(NH3)2]Br
(aq).
Write the...
asked 3 minutes ago -
1. Smoke detectors use Am-241, an alpha emitter, to detect smoke
particles. A parent is concerned...
asked 8 minutes ago -
Scenario: Web application developed to capture customers
demographic and financial information for filling their taxes. This...
asked 12 minutes ago -
Which of the following statements are true?
1. Glass is mostly silicon dioxide and so when...
asked 34 minutes ago -
Korman Company has the following securities in its portfolio of
equity securities on December 31, 2018:...
asked 34 minutes ago -
Using the 12th edition of Language Awareness,
complete the following assignment:
After reading Akiba Solomon's "Thugs....
asked 45 minutes ago -
For all problems assume an effective monthly interest rate of 1%
unless otherwise indicated in the...
asked 56 minutes ago -
Fix all syntax and logical errors for the following program.
Please generate the correct output. //...
asked 1 hour ago -
The USPS sells money orders identified by an 11 –digit number
x1, x2, …, x11. The...
asked 1 hour ago -
Provide an example of equilibrium in relation to
Newton’s First and Second Laws. Explain your answer....
asked 1 hour ago -
You are __________ to commit a Type I error using the 0.05 level
of significance than...
asked 1 hour ago -
1. the following results are obtained:
200
kiwi
575 wild-type
What can we conclude about the...
asked 1 hour ago