Question
Consider the relational schema R(ABCDEG) with the set of functional dependencies F = {D?C, A?BE, BC?D, E?C, AC?B, AB?C}. a) Find all the candidate keys
Consider the relational schema R(ABCDEG) with the set of functional dependencies F = {D?C, A?BE, BC?D, E?C, AC?B, AB?C}.
a) Find all the candidate keys for R.
b) Determine what normal form this relation is in.
c) Find a minimal cover for F. You must show your work.
d) Using 3NF synthesis, find a decomposition of R that is at least in 3NF and is both lossless and dependency-preserving. You must show the projections of functional dependencies on the resulting relations.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Advanced Oracle Solaris 11 System Administration
Authors: Bill Calkins
1st Edition
0133007170, 9780133007176
