Suppose we have the following relation (R) that keeps track of car sales: R(car date_sold, salesperson#,...
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.
Consider relation R(A,B,C,D) with functional dependencies: B → C D→ A BA → D CD → B Decompose R into Boyce-Codd Normal Form (BCNF). Clearly show all intermediary steps.
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....
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...
Write the complete proof.
Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas For each one of the relational schemas, determine the highest normal form, which is valid for a schema. Justify your answer If a schema is not in BCNF, then decompose it into a minimum number of schemas so that each one of them is in BCNF. Justify your answers. Justification must include the derivations of minimal keys from the...
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...
Given the relation below (note that there is a composite primary key in this relation): (PrescriptionNumber, PatientID, Date, Drug, Dosage, PrescriberID, PrescriberName, PatientName) Depending on your assumption for the relation (for example, assume that the value of PrescriberID can uniquely determine the value of PrescriberName), Is this relation in at least 3rd normal form? Explain your reasoning. If your answer to the 2nd question is ‘No,’ normalize this relation to 3rd normal form (or above). Write down the final relation(s)...
The following is the relation notation of the Veterinary Office List. VETERINARY_OFFICE (PetID, PetName, PetType, PetBreed, OwnerID, OwnerLastName, OwnerFirstName, ServiceDescription, ServiceDate, ServiceCharge) The functional dependencies are given below: PetID -> PetName, PetType, PetBreed, OwnerID, OwnerLastName, OwnerFirstName OwnerID -> OwnerLastName, OwnerFirstName ServiceDescription -> ServiceCharge PetID, ServiceDate -> ServicedDescription, ServiceCharge Assumption: A pet belongs to only one owner, while an owner may have more than one pet. A pet receives at most one treatment on any given date. Use the functional dependencies...
Consider the following relation R, where {A, B} is its PK. Assume that R is in the first normal form (INF). R (A, B, C, D, E, F) Functional dependencies: FD1: BàC FD2: AàDE FD3: ABàF Why is this table not in 2NF? Specify which FDs make R violate 2NF. Normalize the data shown in this table to second normal form (2NF). Specify the primary and foreign key (if any) in each table of your 3NF relations. Normalize the data...