8. Consider the following relation instance of the CAR relation schema: CAR Model #cylinders Origin Таx Fee Camry 4 Japan 15 30 Mustang 6. USA 0. 45 Fiat 4. Italy 18 30 Accord 4. Japan 15 30 Century USA 45 Mustang 4 Canada 30 Monte Carlo 6. Canada 45 Civie 4 Japan 15 30 Mustang 4 Mexico 15 30 Mustang 6. Mexico 15 45 Civie 4 Korea 15 30 What is the minimal cover of functional dependencies that exists in CAR? What is (are) the candidate key(s) of CAR? If there is more than one candidate key, select a primary key from among the candidate keys. d. Based on the primary key, what is the immediate Nomal Form violated in CAR? e. Develop a dependency-preserving solution that eliminates this Normal Form violation. Is vour solution a lossless-ioin decomposition? а. b. С.

8. Consider the following relation instance of the CAR relation schema: CAR Model #cylinders Origin Таx Fee Camry 4 Japan 15 30 Mustang 6. USA 0. 45 Fiat 4. Italy 18 30 Accord 4. Japan 15 30 Century USA 45 Mustang 4 Canada 30 Monte Carlo 6. Canada 45 Civie 4 Japan 15 30 Mustang 4 Mexico 15 30 Mustang 6. Mexico 15 45 Civie 4 Korea 15 30 What is the minimal cover of functional dependencies that exists in CAR? What is (are) the candidate key(s) of CAR? If there is more than one candidate key, select a primary key from among the candidate keys. d. Based on the primary key, what is the immediate Nomal Form violated in CAR? e. Develop a dependency-preserving solution that eliminates this Normal Form violation. Is vour solution a lossless-ioin decomposition? а. b. С.

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

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.
Suppose RR is a relation with attributes A1,A2,…,AnA1,A2,…,An. How many superkeys will RR have if a) The only candidate key is A1A1. b) The only candidate keys are A1A2A1A2 and A1A3A1A3.
11 of 40 Consider the following Relation instance of Students: ID firstNamelastName GPA Address 123 Albertson Albertson 3.5 888 CDN 234 Mary Albertson 4.2 759 St. Catherine Est. 345 Smith Smith 2.9 105 Queen Mary 456 Theodore McDonald 3.7 208 Jean Talon West 567 Jean Mary 3.9 950 Des Laurentides 678 Junior Junior 4.1 326 St. Martin West How many records will be in the result of the following SQL Query? Select ID, firstName From Students S Where firstName = lastName and firstName NOT IN ( Select lastName From Students Where ID S.ID); Answer:
36 of 40 Consider the relation scheme R = {A, B, C, D, E, F, G, H} with the following set of functional dependencies: F = {A → D, BH –→ AC, DG → H, F → GH, GH → F} How many candidate keys this relation has? Answer:
Consider the following set F of functional dependencies on the relation schema (А, В, С, D, E, G): А— ВCD ВС — DE В — D D → A
Consider the relation schema R (A, B, C, D) with all possible functional dependencies. For each of the following situations, identify the highest normal form for this relation R. A, C -> B, D C -> D A, C -> B, D B -> D A, C -> B, D
Consider a relation schema R = {A, B, C, D, E, F, G} with the following set of functional dependencies: F = {BG A, A BC, BC A, BD E, E →F, CF B} The decomposition of R into R1 =A, B, C, G), R2 = {B, D, E), R3 = {B, C, F} and R4 = {E, F} is O In 3NF but Not in BCNF. O In 3NF and in BCNF. O Not in 3NF and Not in BCNF O In BCNF but Not in 3NF.
Consider a relation schema R={A, B, C, D, E, G} and its functional dependency set F = {A → BCD,BC →DE,B → D,D → A). Compute B*and choose the answer. - (a) B*= AB (b) B*= ABC (c) B*= ABCD (d) B*= ABCDE (e) none of the above
This question concerns the logical design of a relation schema LOAN describing the borrowing of a book at a library. If a tuple is in this relation, it means that a specific copy with identifica- tion number catalogNo has been borrowed by a library member with identification number memberNo on dateOut (borrowing day) and has been returned on dateReturn (return day). If the book has not yet been returned dateReturn is null. LOAN (catalogNo, dateOut, memberNo, dateReturn) (a) What would the following functional dependency mean? { dateOut, memberNo} → dateReturn (b) Give all full functional dependencies for schema LOAN, assuming that a book can be borrowed just once per day, that members can borrow many books on any given day, and that members can borrow the same book several times.
Given a relation schema R = (A, B, C) and its functional dependencies F = {A →B, B→ C). Suppose R is decomposed in two relations R1 = (A, B) and R2 = (B, C). Is it a lossless join decomposition? Why? Is the decomposition dependency preserving? Why?
Constructing a link such as second course may be done by starting with a number of connections that are many to one in nature. Does the limitation on the relation's many-to-one cardinality get enforced by both the main key constraint and the foreign key constraint? What leads you to believe that is the case?
Consider the relation instance and functional dependencies below. Which of these FDs hold on the instance and which do not? A BC 2 4 АВ — С A → B A → C В > с АС — В ВС — А 3 4 В > А C → A C → B 1 3 5 2 4