Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

mugwump101

  • 3 years ago

Consider a relation with schema R(C,T,S,N,G) and FDs C->T, CS->G, S->N. a) Find a key for the relation using closure test. b) Is relation R in BCNF? If not, decompose R and make the resulting relations in BCNF.

  • This Question is Open
  1. mugwump101
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    X= {C,S} C->T: X+ {C,T,S} CS-> G: X+ {C,T,S,G) S-> N: X+ {C,T,S,N,G} Neither C or S is a superkey. But I'm not sure how to do the res.t

  2. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy