ZuoTi.Pro
Question

4. R(A, B, C, D, E, F, G, H, I, J) where A → B, C, D BE F→ G, H, I (A, F) → B, C, D, E, G, H, I, J


For each of the following relations, normalize it into a set of BCNF relations.
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

BCNF set for above relation:

R(A,B,C,D,F) where A is Super Key

R(B,E) where B is Super Key

R(F,G,H,I) where F is Super Key

0 0
Add a comment
Know the answer?
Add Answer to:
4. R(A, B, C, D, E, F, G, H, I, J) where A → B, C,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Q3: Given a relational schema R = {A,B,C,D,E,F,G,H,1,J,K} and a set of functional dependencies F {A...

    Q3: Given a relational schema R = {A,B,C,D,E,F,G,H,1,J,K} and a set of functional dependencies F {A B C D E, E F G H I J,AI →K} and a key(R) = AI = 1. Is R in BCNF? If yes, justify your answer [5 points] 2. If no, explain why and decompose R for two levels only [10 points] 3. Check whether the decomposition in step 2 dependency preserved or not [5 points]

  • Given R = (A, B, C, D, E, G, H, I) and the set F of...

    Given R = (A, B, C, D, E, G, H, I) and the set F of functional dependencies: BDEI → GH EG → AI DH → CE I → BD use the BCNF algorithm to generate a database design. Is your design dependency-preserving? Why or why not?

  •       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.     ...

          -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Telecommuting       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Change       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Job Sharing       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Job Redesign       -       A.       B.       C.       D.       E.       F.       G.       H.       I.      ...

  • Let, R=(A,B,C,D,E,G) and let F be {A→BDG, BG→DE, B→D, D→A}. Argue that R is not in...

    Let, R=(A,B,C,D,E,G) and let F be {A→BDG, BG→DE, B→D, D→A}. Argue that R is not in BCNF by finding one functional dependency in F that violates the definition of BCNF. Add one more non-trivial dependency to F so that R is in BCNF with respect to the new set of dependencies.

  • A chromosome with genetic markers A, B, C, D, E, F, G, H, I and J...

    A chromosome with genetic markers A, B, C, D, E, F, G, H, I and J ( “*” represents the centromere ) is shown below: A B C D E * F G H I J Another chromosome is found to contain a b c d i h g f * e j If these two chromosomes are paired during meiosis, a single crossover takes place between F and G, and another single crossover takes place between H and I....

  • J-J, f(x)--3, g : S → J, g(s) = nuniber of elements in the string 's', if is even. h : J-J, h(1)- r r if is...

    J-J, f(x)--3, g : S → J, g(s) = nuniber of elements in the string 's', if is even. h : J-J, h(1)- r r if is odd - . where J denotes the set of integers and S denotes the set of all character strings. Calculate each of the following if they exist (if they do not exist explain why they do not exkt): (i) fo r (i) ho f(x), 8 marks) (ii) hofo g(test) J-J, f(x)--3, g :...

  • Imagine a single poorly-designed table, r(R), with attributes A, B, C, D, E, F, G, H,...

    Imagine a single poorly-designed table, r(R), with attributes A, B, C, D, E, F, G, H, I, J, K, L, M. You’ve looked over the naughty designer’s work and come up with the following logical functional dependencies. A —> {B, D, F}? B —> {G, H, I}? {A, C} —> {E, J, K}? {J, K} —> {L, M} H is a composite attribute group with 3 attributes; H1, H2, H3. H3 is a multivalued attribute. L is a multivalued attribute....

  • Consider the relation R(A,B,C,D) with FDs A -> B, C -> D, AD -> C, BC -> A. Check for both BCNF and 3NF status. Which of the following is the most accurate summary of the results?

    Consider the relation R(A,B,C,D) with FDs A -> B, C -> D, AD -> C, BC -> A. Check for both BCNF and 3NF status. Which of the following is the most accurate summary of the results?R is in BCNF and 3NF. No normalization is necessary.R is in 3NF but not in BCNF. We should try normalizing to BCNF, but this results in information being lost. As such, we stay with the original schema.R is in BCNF but not in 3NF....

  • Assume that R(A, B, C, D, E, F) has been decomposed into S(A, C, E, F)...

    Assume that R(A, B, C, D, E, F) has been decomposed into S(A, C, E, F) and other relations. If the dependencies for R are: AB rightarrow C, C rightarrow E, E rightarrow D, D rightarrow F, F rightarrow D. (a) Find ALL non-trivial functional dependencies that hold in S (b) Determine the keys and superkeys of S (c) For each one of your functional dependencies from part a) indicate if it is a BCNF violation, a 3NF violation or...

  • Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b-...

    Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b- R(A,B,C,D) F={BẠC, BD, AD>B} C- R(A,B,C,D) F={AB-C, DC+D, CD+A, AD+B} d- R(A,B,C,D) F={AB=C, C+D, D™B, DE} e- R(A, B, C, D, E) F= {AB+C, DB+E, AE>B, CD+A, ECD} In each case, (i) Give all candidate keys (ii) Indicate the BCNF violation Give the minimal cover and decompose R into a collection of relations that are BCNF. Is it lossless? Does it preserve the dependencies?...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT