A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
anonymous
 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.
anonymous
 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

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0X= {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
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.