Chapter 10: Problem 14
What undesirable dependencies are avoided when a relation is in \(2 \mathrm{NF}\) ?
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 10: Problem 14
What undesirable dependencies are avoided when a relation is in \(2 \mathrm{NF}\) ?
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
} \\ \hline & & & \\ 10 & \mathrm{b} 1 & \mathrm{c} 1 & \\# 1… # Consider the following relation: $$\begin{array}{llll} \mathrm{A} & \mathbf{B} & \mathbf{C} & \text { TUPLE# } \\ \hline & & & \\ 10 & \mathrm{b} 1 & \mathrm{c} 1 & \\# 1 \\ 10 & \mathrm{b} 2 & \mathrm{c} 2 & \\# 2 \\ 11 & \mathrm{b} 4 & \mathrm{c} 1 & \\# 3 \\ 12 & \mathrm{b} 3 & \mathrm{c} 4 & \\# 4 \\ 13 & \mathrm{b} 1 & \mathrm{c} 1 & \\# 5 \\ 14 & \mathrm{b} 3 & \mathrm{c} 4 & \\# 6 \end{array}$$ a. Given the previous extension (state), which of the following dependencies may hold in the above relation? If the dependency cannot hold, explain why by specifying the tuples that cause the violation. i. \(A \rightarrow B,\) ii. \(B \rightarrow C,\) iii. \(C \rightarrow B,\) iv. \(B \rightarrow A, v . C \rightarrow A\) b. Does the above relation have a potential candidate key? If it does, what is it? If it does not, why not?
, Odate, Cust#, Total_amount) ORDER- ITEM(O#, I#, Qty_order… # Consider the following relations for an order-processing application database at \(\mathrm{ABC},\) Inc. ORDER (O#, Odate, Cust#, Total_amount) ORDER-ITEM(O#, I#, Qty_ordered, Total_price, Discount\%) Assume that each item has a different discount. The Total_PRICE refers to one item, OOATE is the date on which the order was placed, and the Total_AMOUNT is the amount of the order. If we apply a natural join on the relations ORDER-ITEM and ORDER in this database, what does the resulting relation schema look like? What will be its key? Show the FDs in this resulting relation. Is it in \(2 \mathrm{NF}\) ? Is it in \(3 \mathrm{NF}\) ? Why or why not? (State assumptions, if you make any.)
Consider the relation \(R,\) which has attributes that hold schedules of courses and sections at a university; \(R=\\{\) CourseNo, SecNo, OfferingDept, Credit- Hours, CourseLevel, InstructorSSN, Semester, Year, Days_Hours, RoomNo, NoOfStudents \(\\} .\) Suppose that the following functional dependencies hold on \(R:\) \\{CourseNo \(\\} \rightarrow\\{\text { OfferingDept, CreditHours, CourseLevel }\\}\) \\{CourseNo, SecNo, Semester, Year) \(\rightarrow\) \\{Days_Hours, RoomNo, NoOfStudents, InstructorSSN \(\left\\{\mathrm{R}_{\text {oom }} \mathrm{No}, \text { Days_Hours, Semester, Year }\right\\} \rightarrow\\{\) Instructorssn, CourseNo, SecNot Try to determine which sets of attributes form keys of \(R .\) How would you normalize this relation?
Consider the following two sets of functional dependencies: \(F=\\{A \rightarrow C, A C \rightarrow\) \(D, E \rightarrow A D, E \rightarrow H\\}\) and \(G=\\{A \rightarrow C D, E \rightarrow A H\\} .\) Check whether they are equivalent.
Prove or disprove the following inference rules for functional dependencies. A proof can be made either by a proof argument or by using inference rules IR1 through IR3. A disproof should be performed by demonstrating a relation instance that satisfies the conditions and functional dependencies in the left-hand side of the inference rule but does not satisfy the dependencies in the right-hand side. a. \(\\{W \rightarrow Y, X \rightarrow Z\\} \vDash\\{W X \rightarrow Y\\}\) b. \(\\{X \rightarrow Y\\}\) and \(Y \supseteq Z \vDash\\{X \rightarrow Z\\}\) ?. \(\\{X \rightarrow Y, X \rightarrow W, W Y \rightarrow Z\\} \vDash\\{X \rightarrow Z\\}\) d. \(\\{X Y \rightarrow Z, Y \rightarrow W\\} \vDash\\{X W \rightarrow Z\\}\) e. \(\\{X \rightarrow Z, Y \rightarrow Z\\} \vDash\\{X \rightarrow Y\\}\) f. \(\quad\\{X \rightarrow Y, X Y \rightarrow Z\\} \vDash\\{X \rightarrow Z\\}\) \(\mathrm{g} .\\{X \rightarrow Y, Z \rightarrow W\\} \vDash\\{X Z \rightarrow Y W\\}\) h. \(\\{X Y \rightarrow Z, Z \rightarrow X\\} \vDash\\{Z \rightarrow Y\\}\) ¡. \(\\{X \rightarrow Y, Y \rightarrow Z\\} \vDash\\{X \rightarrow Y Z\\}\) j. \(\quad\\{X Y \rightarrow Z, Z \rightarrow W\\} \vDash\\{X \rightarrow W\\}\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.