Chapter 10: Problem 6
Why can we not infer a functional dependency automatically from a particular relation state?
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 6
Why can we not infer a functional dependency automatically from a particular relation state?
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
Consider the following relation for published books: BOOK (Book_title, Authorname, Book_type, Listprice, Author_affil, Publisher) Author_affil refers to the affliation of author. Suppose the following dependencies exist: Book_title \(\rightarrow\) Publisher, Book_type Book_type \(\rightarrow\) Listprice Authorname \(\rightarrow\) Author-affil a. What normal form is the relation in? Explain your answer. b. Apply normalization until you cannot decompose the relations further. State the reasons behind each decomposition.
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\\}\)
When are two sets of functional dependencies equivalent? How can we determine their equivalence?
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.
Define first, second, and third normal forms when only primary keys are considered. How do the general definitions of \(2 \mathrm{NF}\) and \(3 \mathrm{NF}\), which consider all keys of a relation, differ from those that consider only primary keys?
What do you think about this solution?
We value your feedback to improve our textbook solutions.