Given the relation R and the following functional dependencies, answer the follo

Question

Given the relation R and the following functional dependencies, answer the following questions. R(A, B, C, D, E, F, G) All attributes contain only atomic values.

FD1: AB ? C FD2: BC ? E FD3: B ? D FD4: F ? G

(a) Compute A+, the attribute closure of attribute A.

(b) List the candidate keys of R.

(c) What’s the highest normal form that R satisfies and why?

(d) If R is not already at least in 3NF, then normalize R into 3NF and show the resulting relation(s) and their candidate keys. Your decomposition should be both join-lossless and dependency-preserving. If R is already in 3NF, just list the candidate keys of R.

(e) Is your answer to (d) also in BCNF? Why or why not?

Explanation / Answer

Solution:

Note: I have solved first two, please repost others.

a)

A+ =A since A is driving nothing

b)

Candidate keys are the one who drives all the attributes of the relation from the dependency

AB+= ABCDE

ABF+= ABCDEFG

ABF is the only candidate key

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.