Consider the following relation R(A, B, C, D, E, G) and the set of functional dependencies...

Consider the following relation R(A, B, C, D, E, G) and the set of functional dependencies F={ A → BCD,
BC → DE, B→D, D → A}

Note: Show the steps for each answer.

(a) Compute B⁺ .

(b) Prove (using Armstrong’s axioms) that AG is superkey.

(c) Compute F_c.

(d) Give a 3NF decomposition of the given schema based on a canonical cover.

(e) Give a BCNF decomposition of the given schema based on F. Use the first functional dependency as the violator of the BCNF condition.

Expert Solution

venereology answered 1 month ago

For the relation R(A,B,C,D,E) with the following Functional Dependencies: A → B, A → C, BC...

For the relation R(A,B,C,D,E) with the following Functional Dependencies: A → B, A → C, BC → D, AC → E, CE → A, list all non-trivial FDs following from the above. Generate all possible keys for R. Check whether R is in 3NF. If it is in 3NF, explain the criteria you used. If it is not in 3NF, convert it into 3NF, showing the new relations and their FDs.

Consider the relation R= {A, B, C, D, E, F, G, H} and the set of...

Consider the relation R= {A, B, C, D, E, F, G, H} and the set of functional dependencies: FD= {{B}—> {A}, {G}—> {D, H}, {C, H}—> {E}, {B, D}—> {F}, {D}—>{C}, {C}—> {G}} 1) Draw FD using the diagrammatic notation. 2) What are all candidate keys for R? 3) If delete {C}—>{G} and change {C, H}—> {E} to {C, H}—> {E, G}, what are all candidate keys for R

Consider a relation R (ABCDEFGH) with the following functional dependencies: ACD --> EF AG --> A...

Consider a relation R (ABCDEFGH) with the following functional dependencies: ACD --> EF AG --> A B --> CFH D --> C DF --> G F --> C F --> D Find minimal cover and identify all possible candidate keys. In order to receive full credit, please list each step taken and the rules that you applied.

=>Set of functional dependencies(F) = {A -> BC, BC -> AD, D -> E} =>Set of...

=>Set of functional dependencies(F) = {A -> BC, BC -> AD, D -> E} =>Set of functional dependencies(F) = {AB -> C, A -> DE, B -> F, F -> GH, D -> IJ} Decompose the previous R{A, B, C, D, E, F, G, H, I, J} into each higher normal form relations above its current NF. For example, if its current NF is 0NF, then you need to decompose R to 1NF relations, 2NF relations, up to 3NF relations...

Relational Modelling (20 marks) For the relation: R (A, B, C, D, E, F, G) The...

Relational Modelling For the relation: R (A, B, C, D, E, F, G) The following functional dependencies hold: F -> D G -> B C -> D F -> C, E B -> F A -> F, G 2.1 Use Inference rules to find the minimal b asis. 2.2 Determine the primary key of the relation. 2.3 Based on this key, determine if the relation R is in BCNF. Explain your answer in terms of the FDs and the key....

Consider the cross: A/a; b/b; C/c; D/d; E/e x A/a; B/b; c/c; D/d; e/e a) what...

Consider the cross: A/a; b/b; C/c; D/d; E/e x A/a; B/b; c/c; D/d; e/e a) what proportion of the progeny will phenotypically resemble the first parent? b) what proportion of the progeny will genotypically resemble neither parent?

Given the following knowledge base: a <- b^c. b <- d^e. b <- g^e. c <-...

Given the following knowledge base: a <- b^c. b <- d^e. b <- g^e. c <- e. d. e. ƒ <- a^g. Which of the following would be the trace of resolved atoms assuming a bottoms-up proof procedure? Select one: a. {a,b,c,e,g} b. {a,b,c,e,d} c. {g,e,b,e,c,a} d. None of these options Constraint Satisfaction Problem (CSP) is consists of a set of _________________. Select one: a. Variables, heuristics, and solutions b. Variables, domains, and backtracking c. Variables, domains, and constraints d....

Normalization: Answer all 4 questions. You are given the following relation R and some functional dependencies....

Normalization: Answer all 4 questions. You are given the following relation R and some functional dependencies. R(SID, Project, Code, ListOfSupplies, Name, Initials, Abbrev) Project → ListOfSupplies SID → Name Name → Initials Project, Initials → Abbrev SID, Project → Code Code → SID Is R in 1NF? If not, normalize R into a collection of 1NF relations. Is R in 2NF? If not, normalize R (or your collection of 1NF relations) into a collection of 2NF relations. Is R in...

Let R be the relation on Z+× Z+ such that (a, b) R (c, d) if...

Let R be the relation on Z+× Z+ such that (a, b) R (c, d) if and only if ad=bc. (a) Show that R is an equivalence relation. (b) What is the equivalence class of (1,2)? List out at least five elements of the equivalence class. (c) Give an interpretation of the equivalence classes for R. [Here, an interpretation is a description of the equivalence classes that is more meaningful than a mere repetition of the definition of R. Hint:...

Consider a relation R with five attributes ABCDE. You are given the following dependencies: A à...

Consider a relation R with five attributes ABCDE. You are given the following dependencies: A à B, BC à E, and ED à A. (1) List all candidate keys for R. Please show your steps. (4 points) (2) Is R in 3NF? Please explain your answer. (3 Points) (3) Is R in BCNF? Please explain your answer. (3 Points)

Question