Using the schema R=(A,B,C,D,E,G,H,I) and the set F of functional dependencies: B
ID: 3683322 • Letter: U
Question
Using the schema R=(A,B,C,D,E,G,H,I) and the set F of functional dependencies:
BE G,
HG AI ,
D C ,
I B
1.List those attributes that must appear in every candidate key for R and justify your answer.
2. Is R in BCNF? Justify your answer.
3. Apply one step in the BCNF decomposition algorithm on R (thus, your result may not be in BCNF since there may be more steps after this one). For your resulting schemas, state whether each is in BCNF and justify your answer. (HINT: read ahead before doing this since your choice here may make the following questions either easier or harder.)
4. Is your decomposition from question 3 lossless?
5. Does your decomposition preserve dependencies? Explain your answer not simply by stating the definition but rather by applying that definition to your specific example.
6. List all candidate keys for R.
7. Give a lossless, dependency-preserving decomposition of R into 3NF.
Explanation / Answer
Multiple Questions : Answering 1st one.
1. DEH . Since D,E,H is not present in any of the FD's right hand side.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.