Make up a small relation instance (i.e., data in the table) for relation schema R( A,...
Make up a small relation instance (i.e., data in the table) for relation schema R( A, B, C) that satisfies functional dependency: AB --> AC, but does not satisfy dependency B --> C.
Homework Answers
Add Answer to:
Make up a small relation instance (i.e., data in the table) for
relation schema R( A,...
Discuss the normal forms for a relational database schema. What does functional dependency mean? Given is...
Discuss the normal forms for a relational database schema. What does functional dependency mean? Given is the relational schema R( A, B, C, D, E ) as well as the functional dependencies • AC → BDE • B → D • A → E. Convert the schema into its 3rd normal form.
Consider the relation schema R(T, E, C, D, Y) and the following set of F of...
Consider the relation schema R(T, E, C, D, Y) and the following set of F of functional dependencies: CY à E E à Y DY à T CT à D The relation R decomposes into R1(C, Y, E), R2(C, T, D). 1. Is this decomposition lossless-join? _________________Blank 1 True False 2. Is this decomposition dependency preserving? ? _____________Blank 2 True False
Principles of Information and Data Management problem: 3. Given the following schema of a relation R(A,B,C,D,E) with the following functional depen- dencies: AB → C, C → D, D → B. D → E. and the foll...
Principles of Information and Data Management problem:
3. Given the following schema of a relation R(A,B,C,D,E) with the following functional depen- dencies: AB → C, C → D, D → B. D → E. and the following data: l B | C | D | E 112 3 2 1 23 1 2 13 5 25 22 3 1 | 2 237 25 3 11 3 2 3 2 4| 2 3 |352 5 (a) Decompose R into tables in...
Using DDL (data definition language) statement(create table statement) to define each relation schema, i.e., giving the...
Using DDL (data definition language) statement(create table statement) to define each relation schema, i.e., giving the create table statement for each relation schema with the definition of primary key in each table. Each employee has a name, social security number (primary key), gender, age, and salary. Each employee works for only one department, and there are more than one employee working in a department. Each department has a department name, a department number (pk), and a department location.
Consider a relation R with five attributes A, B, C, D, and E. You are given...
Consider a relation R with five attributes A, B, C, D, and E. You are given the following functional dependencies: A → B, BC→E, and ED→A. (a) Is R in BCNF? If it is not, decompose it into a collection of BCNF relations. 2: BCNF and 3NF (3 points) Consider the relation schema R with attributes A, B, C, and D and the following functional dependencies: AB→C, AC→B, B→D, BC→A. (a) Is R in BCNF? If it is not, decompose...
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...
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 following relation: R(A,B,C,D,E) The following set of functional dependencies are ture on the relation...
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
DATABASE NORMALIZATION Answer the following questions for this relational schema and functional dependencies: R (A, B,...
DATABASE NORMALIZATION Answer the following questions for this relational schema and functional dependencies: R (A, B, C, D, E, F, G, H, I) A -> C ; C -> D ; A,C -> D B -> E,F ; A,B -> G ; G -> H,I ; A,G -> I List all candidate keys of R. (2 marks) Does the functional dependency A,C -> I hold? (1 mark) Does the functional dependency B -> F hold? (1 mark) Normalize R into...
please do question 4. Note that we follow the convention of denoting the set of attributes...
please do question 4.
Note that we follow the convention of denoting the set of attributes {A, B, C} by ABC when we write FDs but not when we write schemas. Given the following set set F of FDs on schema R= (A, B, C, D, E,G): A + BC AB + CD B +C E →D G +C EG → AD Answer the following questions. Questions 1-4 require a formal proof or disproof. A proof may be given either...
Principles of Information and Data Management problem:
3. Given the following schema of a relation R(A,B,C,D,E) with the following functional depen- dencies: AB → C, C → D, D → B. D → E. and the following data: l B | C | D | E 112 3 2 1 23 1 2 13 5 25 22 3 1 | 2 237 25 3 11 3 2 3 2 4| 2 3 |352 5 (a) Decompose R into tables in...
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...
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
please do question 4.
Note that we follow the convention of denoting the set of attributes {A, B, C} by ABC when we write FDs but not when we write schemas. Given the following set set F of FDs on schema R= (A, B, C, D, E,G): A + BC AB + CD B +C E →D G +C EG → AD Answer the following questions. Questions 1-4 require a formal proof or disproof. A proof may be given either...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago