1. Assume a relational schemas R(A,B,C,D,E)，FDs set of it is F={AB，BC，CDE, E->A} :

Give the results of A ⁺ ，ED ⁺

find the candidate keyword of R and write a simple process；

determine which Norm Form R belongs to and explain the reason.

2. Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies F = { {A, B}→{C}, {A}→{D, E}, {B}→{F}, {F}→{G,H}, {D}→{I, J} }. What is the key for R? Decompose R into 2NF and then 3NF relations.

3. Consider the following relation for published books:

BOOK (Book_title , Author_name , Book_type , List_price , Author_affil ,

Publisher )

Author_affil refers to the affiliation of author. Suppose the following dependencies exist:

Book_title → Publisher , Book_type

Book_type → List_price

Author_name → Author_affil

a. What normal form is the relation in? Explain your answer.

b. Apply normalization until you cannot decompose the relations further.State the reasons

behind each decomposition.

Answer rating: 100% (QA)

Answer s Solution1 I have some trouble in solving this Solution2 The demostration os the Keys are A ... View the full answer