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.

2.4 If the relation R is not in 3NF or BCNF, then decompose the relation to 3NF/BCNF.

Expert Solution

venereology answered 8 months ago

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 the following relational schema and set of functional dependencies. S(A,B,C,D,E,F,G) D → E E →...

Consider the following relational schema and set of functional dependencies. S(A,B,C,D,E,F,G) D → E E → B C → FG BE → AC Is the decomposition of S into S1(E,G,F) and S2(A,B,C,D,G) a lossless join decomposition? Choose one of the following queries as your answer: SELECT ’lossy’; SELECT ’lossless’;

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 Fc. (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...

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.

Q1. a. Given a schema R (A, B, C, D, E, F) and a set F...

Q1. a. Given a schema R (A, B, C, D, E, F) and a set F of 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 ?+ b. Given a schema R = CSJDPQV and a set FDs of functional dependencies FDs = {C → CSJDPQV, SD → P, JP → C, J → S} 1. Find...

If there are 7 total notes C, D, E, F, G, A, and B and if...

If there are 7 total notes C, D, E, F, G, A, and B and if a five-note melody is selected at random (so that all melodies counted in part (a) are equally likely to be chosen), what is the probability that the melody will include exactly two “A” notes, but no other repeated notes? (A few allowable examples: AACEG, ACAEG, DFACA, EAABC, etc.)

1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4....

1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4. T→¬B, T→¬D ∴ T→¬(B∨D) 5. ¬(M∨¬S), S→(R→M) ∴A → (¬R∨T) 6. (F&G) → I, (I∨J) → K ∴F→(G→K) 7. ¬U, O→G, ¬(O∨G) →U ∴G Prove that the arguments are valid by constructing a dedication using the rules MP, MT, DN, Conj, Simp, CS, Disj, DS, DM, CP, HS, BE, and DL. Use CP if needed.

Seven people (A,B,C,D,E, F, and G) are seated in a row. Suppose A,B, and C are...

Seven people (A,B,C,D,E, F, and G) are seated in a row. Suppose A,B, and C are freshmen, D and E are sophomores and F and G are juniors. How many arrangements are possible if: (a) D and F must sit together? (b) A and C must not sit together? (c) All freshmen must sit together? (d) All freshmen must sit together, all sophomores must sit together, and all juniors must sit together? (e) Exactly two people sit between A and...

(a) (f ∘ g)(3) (b) g(f(2)) (c) g(f(5)) (d) (f ∘ g)(−3) (e) (g ∘ f)(−1) (f) f(g(−1))

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

Question