Question

3. What is the closure of {A, B} in R(A, B, C, D, E, F, G) with respect to the following sets of func- tional dependencies: (

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Solution:

Closure set of attribute is the set of attributes that can be derived from a given attribute set.

Question 1:

Closure set of {A,B} for R(A,B,C,D,E,F,G)

The functional dependencies are A->ABD,ABDEF->CG,D->E,AB->C

Here the closure of AB includes all attributes that can derive from AB.

SO {A,B}+={A,B,D,C,E} i.e

From First FD A-> ABD will include in closure of A

since attribute D is deriving from A D->E will also includes so {A,B,D,E}

similarly AB->C also included in the closure of A.where as second FD ABDEF->CG will not include because F is not derived by A.

so the final answer of {A,B}+ is {A,B,C,D,E}

Question 2:

The FD's are D->A,D->EF,ABG->CA->B,AB->D

So {A,B}+={A,B,D,E,F}

Here C and G is not included in closure of A since those attribues are not able to derive from A.

So for the second question {A,B}+ is {A,B,D,E,F}

Note: if you have any queries please post a comment thanks a lot....always available to help you..

Add a comment
Know the answer?
Add Answer to:
3. What is the closure of {A, B} in R(A, B, C, D, E, F, G)...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E)...

    Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E) C D → B A → D D → C E → C What is the closure of AB ({AB}+)? What is the closure of F (F+)? [ set of closures for all LHS][each LHS on one line] What is the minimal set (cover) for F? Provide a key for relation R (a minimal set of attributes that can determine all attr.) Decompose the...

  • Given relation R(A, B, C, D, E, F), give (i) the key(s) of R and (ii)...

    Given relation R(A, B, C, D, E, F), give (i) the key(s) of R and (ii) the normal form of R if the FDs are: (d) AB -> C, CD -> EF (e) AB -> CD, D -> EF, C -> AB. (f) ABC -> D, ABC -> E, ABC -> F.

  • 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...

  • 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.

  • Given a schema R (A, B, C, D, E, F)and a set Fof functional dependencies {A...

    Given a schema R (A, B, C, D, E, F)and a set Fof functional dependencies {A →B, A →D, CD →E, CD →F, C →F, C →E, BD →E}, find the closure of the set of functional dependencies ?+

  • Consider the schema R=(A, B, C, D, E) and let the following set F of functional...

    Consider the schema R=(A, B, C, D, E) and let the following set F of functional dependencies hold for R: F= {A → BC, CD → E, B D } Problem 3 Suppose that the schema R=(A, B, C, D, E) is decomposed into R/ - (A, B, C) and R=(A, D, E). Show if this decomposition is a lossless decomposition with respect to the given set of functional dependencies F.

  • Question 1: Functional Dependencies [7 marks Consider a relation R on attributes (A, B, C, D,...

    Question 1: Functional Dependencies [7 marks Consider a relation R on attributes (A, B, C, D, E, F,G, H) and the following functional dependen- cies. B →G C →D DE →GC → EF DEF → H (a) What is the closure of [F, G, Hy? (b) List all of the candidate keys of R under the dependencies above. (c) List all of the FDs above that are 3NF violations (d) List all of the FDs above that are BCNF violations....

  • Consider the relation R with attributes: A, B, C, D, E, and F Let S be...

    Consider the relation R with attributes: A, B, C, D, E, and F Let S be a set of functional dependencies in R such that S = { A-> B, CD-> E, C-> D]. Which of these attributes are in the closure of [C, F)?

  • Consider the schema R = (A, B, C, D, E) and let the following set F...

    Consider the schema R = (A, B, C, D, E) and let the following set F of functional dependencies holdforR: F = {A -> BC, CD -> E, C -> A, B -> D,} 1) Prove or disprove ADE is in the closure of F. A proof can be made by using inference rules IR1 through IR3. A disproof should be done by showing a relational instance (counter example) that refutes the rule. 2) What are the candidate keys of...

  • 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