Suppose you are given a relation R= (A,B,C,D,E) with the following functional dependencies: {BC ->ADE, D -> B}. Find all candidate keys. Select one: a. {B,C} and {C,D} b. {B,E} and {D,A} c. {B,C} d. {A,B}
Added by Belen F.
Close
Step 1
e., their closure includes all attributes): {B,C}: (B,C)+ = BC (using BC -> ADE) = BCDE (using BC -> ADE) = BCDE (using D -> B) = BCDE (using BC -> ADE) = BCDE (using D -> B) = BCDE (using BC -> ADE) = BCDE Show more…
Show all steps
Your feedback will help us improve your experience
James Kiss and 92 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
Consider the relation schema R = (A, B, C, D, E, F, G, H, I, J) with functional dependencies FD = {B→E, E→FH, BCD→G, CD→A, A→J, I→BCDE, H→I}. Determine if B→J holds and list every candidate key. Show each step. THEN Consider a relation schema R(X, Y, Z) with the functional dependencies XY→Z and Z→X. Can we conclude that Y→XZ holds? If yes, please argue why. If no, please argue why not by giving a counterexample.
Sri K.
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.
Aarya B.
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