Question

Please quesiton on database function dependency: Suppose we have relation R (A, B, C, D, E),...

Please quesiton on database function dependency: Suppose we have relation R (A, B, C, D, E), with some set of FD’s , and we wish to project those FD’s onto relation S (A, B, C). Give the FD’s that hold in S if the FD’s for R are:

c) AB --> D, AC --> E, BC --> D, D --> A, and E --> B.

d) A --> B, B --> C, C --> D, D --> E, and E --> A.

In each case, it is sufficient to give a minimal basis for the full set of FD’s of S.

Homework Answers

Answer #1

Functional dependency-is a relationalship between two attribute. one attribute is a primary key and other non-primary key.

x---->y

where x= determinant

y= dependent

(c). AB-->D,AC-->E,BC-->D,D--->A AND E---> B

ANS- AB-->ABD (NOT FD)

AC-->ACEBD { AC-->E,E--->B,BC--->D} ( FD)

D-->AD { D-->A}

NOT FD

E-->BE { E-->B}

functional dependency - AC--> E

(d) A-->B

B-->C

C--->D

D--->E

E--->A

Ans- A-->BACDE { A-->B,B-->C,C--->D,D--->E,E--->A} (FD)

B--->CBDEA { B-->C,C--->D,D--->E,E--->A} (FD)

C--->DCEAB { C-->D,D-->E,E--->A,A--->B } (FD)

D--->EDABC { D-->E,E--->A,A-->B,B--->C} (FD)

E---->AEBCD { E--->A,A-->B,B-->C,C--->D} (FD)

functional dependency- { A,B,C,D,E}

Know the answer?
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
Similar Questions
There are the set of FD for a Relation R(A, B,C,D,E,F,G) F= (A->B, BC->DE, AEF->G, AC->DE)...
There are the set of FD for a Relation R(A, B,C,D,E,F,G) F= (A->B, BC->DE, AEF->G, AC->DE) Then a) What are the Candidate keys for R? Justify your answer. b) Is R in BCNF? Justify your answer. c) Give a 3NF decomposition of this Relation. d) Is your answer above is Lossless join and Dependency Preserving.?
Suppose we have the following relation R with composite primary key {A,B} together with the set...
Suppose we have the following relation R with composite primary key {A,B} together with the set FD of functional dependencies: R(A,B,C,D,E,F,G). FD = { C -> G, E -> B, A -> D, AB -> C, AB -> D, AB -> E. AB -> F, AB -> G } Draw the initial dependency diagram using the above information. The relation from part a) is in first normal form. Using the techniques described in the lecture, convert it to 2NF by...
Please answer ASAP Database Consider the relation scheme R = {A, B, C, D, E} with...
Please answer ASAP Database Consider the relation scheme R = {A, B, C, D, E} with the FDs A --> BC CD --> E Consider the following decompositions: (4.a) R1 = {A, B, C} and R2 = {C, D, E} (4.b) R1 = {A, B, C} and R2 = {A, D, E} (4.c) R1 = {A, B} and R2 = {A, C, D, E} (4.d) R1 = {A, B, C}, R2 = {C, D, E} and R3 ={A, D}. For...
There is no equivalence relation R on set {a, b, c, d, e} such that R...
There is no equivalence relation R on set {a, b, c, d, e} such that R contains less than 5 ordered pairs (True or False)
Given a relation R(A, B, C, D, E) with the following FD Set FD = {...
Given a relation R(A, B, C, D, E) with the following FD Set FD = { A→C, B→C, C→D, DE→A, CE→A} Suppose we decompose it into R1(A, D), R2(A, B), R3(B, E), R4(C, D, E) and R5(A, E), is it a lossless decomposition? Show your proof.
Consider the following legal instance of a database: A B C D E ‘a’ 11 3...
Consider the following legal instance of a database: A B C D E ‘a’ 11 3 ‘XY’ 123 ‘aa’ 11 7 ‘XY’ 234 ‘abc’ 22 15 ‘XY’ 345 ‘a’ 22 16 ‘XY’ 456 Can the following functional dependency hold? A --> B
Define a relation on N x N by (a, b)R(c, d) iff ad=bc a. Show that...
Define a relation on N x N by (a, b)R(c, d) iff ad=bc a. Show that R is an equivalence relation. b. Find the equivalence class E(1, 2)
4. Consider the relation schema R(ABCDE) with the set of functional dependencies F={B→E, A→B, DE→C, D→A,...
4. Consider the relation schema R(ABCDE) with the set of functional dependencies F={B→E, A→B, DE→C, D→A, C→AE}. For the following relations resulting from a possible decomposition of R, identify the non-trivial functional dependencies which can be projected to each of the decomposed relations. a) S(ABC) b) T(BCE) c) U(ABDE
2. Define a relation R on pairs of real numbers as follows: (a, b)R(c, d) iff...
2. Define a relation R on pairs of real numbers as follows: (a, b)R(c, d) iff either a < c or both a = c and b ≤ d. Is R a partial order? Why or why not? If R is a partial order, draw a diagram of some of its elements. 3. Define a relation R on integers as follows: mRn iff m + n is even. Is R a partial order? Why or why not? If R is...
We have a triangle ABC. a=|BC|, b=|CA|, c=|AB| and ∠A=v , ∠B=r , and ∠C=z Calculate...
We have a triangle ABC. a=|BC|, b=|CA|, c=|AB| and ∠A=v , ∠B=r , and ∠C=z Calculate c, if we know that ∠C is acute and a=8, b=3 and sin (z) = 1/7