Show that the relation schemas produced by Algorithm 15.4 are in 3NF.
Added by Rachel C.
Step 1
4 produces relation schemas by decomposing a relation schema into smaller ones based on functional dependencies. The resulting relation schemas are in 3NF if they meet the following conditions: Show more…
Show all steps
Your feedback will help us improve your experience
Reynald Oliveria and 74 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Supreeta N.
Consider the relation schema R = (N, Y, P, M, C) and assume that the following set of functional dependencies holds on R: F = { N → M, NY → P, M → C} The letters can be interpreted as follows: R = (Model_Number, Year, Price, Manufacturing_Plant, Color). Give a lossless-join decomposition of R into Boyce-Codd normal form. Make sure to use the algorithm and to show all details. Does your decomposition preserve functional dependencies? Justify your answer. Is R in 3NF? Justify your answer. You can use the fact that R has only one candidate key, NY.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD