Problem 1 Convert the following relation to 2NF, and then to 3NF. Show both conversions. (h, n, c, a, f, k, p, r, g, i, m, b, o, d, j, I, s, e) Functional Dependencies: m, b >I n >o p>o a >r h >g c>i h >d

Problem 1 Convert the following relation to 2NF, and then to 3NF. Show both conversions. (h, n, c, a, f, k, p, r, g, i, m, b, o, d, j, I, s, e) Functional Dependencies: m, b >I n >o p>o a >r h >g c>i h >d

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: b) Consider the following relation R2 and set of functional dependencies F2 R={A, B, C, D, E, F, G,…

A: Dear Student, The answer to your question is given below -

Q: Consider the relation schemas R(A,B) and S(A,B). Suppose {A } is the key for R and also the key for…

A: Even though {A} is the key for both R and S, the union of R and S has the complete keyset, so here…

Q: Question 1 Suppose you are given a relation R = (A, B, C, D, E) with the following functional…

Q: Question: Consider the relation: R(A, B, C, D, E, F, G, H, I, J, K, L,M,N,O,P,Q), {A, B} is the…

A: R(A, B, C, D, E, F, G, H, I, J, K, L,M,N,O,P,Q) Candidate key: {A, B}, {C,D,E}Prime attributes Non…

Q: 3. Disprove the following rule: {B > CD, AB → E, E → C} |= {AE → CD} To disprove a rule, construct a…

Q: Consider the following Relation (R) and its Functional dependencies. R(0, μ, y, α, B), {0, µ} → {a},…

A: Candidate key is Qu As per guidelines solve only first question please repost question as a…

Q: Let R(A,B,C,D,E,F,G) be a relation with the FDs: F= (CDG, DG-C, AD-G, G-A, AB-F). Consider the…

Q: 5. Consider a relation R(A, B, C, D, E) with the following dependencies: AB → C, CD → E, DE → B

A: Given: Consider the relation R(A,B,C,D,E) with the following dependency: AB -> C CD -> E DE…

Q: Problem 3 Consider the relation R = {A, B, C, D, E, F,G, H, I, J} and the set of functional…

Q: 2 Consider the following functional dependencies for the given relation. R={A, B, C, D, E, F) AB->CD…

A: Dear Student, The answer to your question is given below -

Q: Select the following relations on that are transitive. {(a,b) a²> b} {(a, b) | a²b² (mod 7)}…

Q: PQ → TY ii. P → QR iii. QST → R iv. STR → P From the above functional dependencies, using…

A: Given:- i. PQ → TY ii. P → QR iii. QST → R iv. STR → P From the above functional dependencies,…

Q: Suppose R(A,B) is a relation schema with no constraints. Currently, R has 3 tuples: (1,2), (2,3),…

A: answer to the above question is in step2.

Q: [A, B, C, D, E, F, G, H, I, J, K, L, M, N] B, C} → {D, E} {A, B, C, G} M} → {G, H, I, J} > {K, G}

Q: Assume a relation schema R(a, b, c, d, e, f) with primary key (a, b) and the following full func-…

A: Functional Dependencies:- Functional dependencies are the result of the interrelationship between…

Q: For each pair of functions below, select the correct answer for their relation in terms of orders of…

A: Big-O is a mathematical notation that expresses how efficient an algorithm is in the worst-case…

Q: QUESTION 8 Here's a relation (R), its attributes, and its functional dependencies (F): R(A, B, C, D,…

A: A functional dependency is defined as if in a relation A→B , the values in attribute A have the same…

Q: Comment say : True / False. whether the decomposition of R ( A, B, C,D , E , G) in (ABCE , BD , AEG…

A: Introduction : Given , Relational Schema R(A,B,C,D,E,G).And its functional dependencies are also…

Q: Consider a relation (A, B, C, D, E, F, G) with functional dependencies as given below: ABC D ED-F…

A: Consider the following relation with set of functional dependencies: R (A, B, C, D, E, F, G)…

Q: Consider the following set F of functional dependencies on the relation schema(A, B, C, D, E, G):A →…

A: The original relation is r(A,B,C,D,E,F). This relation is not BCNF due to the first functional…

Q: Question 10. Consider the relation R (ABCDE) and functional dependencies set {A highest normal form…

A: Steps to find highest normal form of relation: Find all possible candidate keys of the relation.…

Q: Consider the relation R(A, B, C, D, E), and the decomposition of R into R1(ABC) and R2(ADE). (a)…

Q: . Consider the following relation with set of functional dependencies R(ABCDEF) ABC->D, ABD->E,…

Q: Question 3 Consider a relation A(P, Q, R, S, T) with following functional dependencies. i.Р— QR ii.…

A: Relation: f a purposeful dependency X->Y holds true whereverY isn't a set of X then this…

Q: Given the relation R (A, B, C, D, E) and the following set of functional dependencies: F = {ABC,…

Q: Given the relation R(C, D, E, F) and functional dependency: C-> DF Which of the following functional…

A: Answer to the above question is in step2.

Q: Consider the following set of functional dependency for the relation schema R = (А, В, С, D, E, F,…

A: Objective: A relation R (A,B,C,D,E,F,G,H) is given. We need to convert this functional dependency up…

Q: the dependencies A →→ BC, B → D, and C →→ E

A: Given :- In the above question, a Relation R(A,B,C,D,E) along with the function dependencies mention…

Q: A decomposition of a relation R into Rị and R2 is dependency preserving, if - (a) R can be…

A: Answer: The correct option is “(d) All of them”

Q: Question 6. Consider the relation R(ABCDE) and its functional dependencies set {AB->C, C->E, B-> D,…

A: Answer of the given question: choice (d) is the correct answer. Lossless Decomposition: Lossless…

Q: Relations 2. Given: Relation R1 = {(a,a), (a,b), (c,b), (c,e), (d,b), (d,e), (e,e)} %3D Relation R2…

A: Relation R1 = {(a,a), (a,b), (c,b), (c,e), (d,b), (d,e), (e,e)} Relation R2 = {(q1,q2), (q2,q3),…

Q: Functional Dependencies and Normalization Exercise 1: Consider the following relation:…

A: Question: Functional Dependencies and Normalization Exercise 1: Consider the following relation:…

Q: Computer Science Given the relation R (A, B, C, D, E, F, G) and the set of functional dependencies:…

Q: Given the relation R(A, B, C, D, E, F), the following functional dependencies exist: B --> C, D D…

A: Given : R(A, B, C, D, E, F) B --> C, DD --> F

Q: Consider a relation (p, q, r, s, t, u, v) with functional dependencies as given below: p>q r>s,t…

A: Defined candidate key for the given relational schema

Q: Find the candidate key(s) for the following relations.

Q: g set of five functional dependencies which hold on R: A → B A C BD → E EC → A E →G ompute the…

A: Closure (CE) = { C, E, G, A, B} Closure (AD) ={A, D, B, C, E, G}

Question

ISAM 3331: Introduction to Business Database Application Development
Chapter 4 Assignment
Fall 2020
Problem 1
Convert the following relation to 2NF, and then to 3NF. Show both conversions.
(h, n, c, a, f, k, p, r, g, i, m, b, o, d, j, I, s, e)
Functional Dependencies:
m, b →I
n >o
p>o
a >r
h > g
c> i
h > d
s>e

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Let's suppose, a relation R=(A, B, C, D, E. H) with a set of functional dependencies F: (AE->BC, B ->AD, CD->E, E→CD, A->E) is given. Relation R (A, B, C, D, E, H) is decomposed into R1 (A, B, C, D) and R2 (A, B, E, H). Find out whether the decomposition is lossless or not, and whether it is dependency preserving or not.
Let W(A, B) and Q(C,D) be two relation schemas. Let r₁ and r2 be the corresponding relation instances. B is a foreign key that refers to C in r2. Assuming that all tuples in r₁ and r2 satisfy referential integrity constraints, which of the following is ALWAYS TRUE? (А) Пв (г1) - Пс (rz) =Ø (B) IIc (₂)-118 (1₁) = 0 (С) Пв (г1 ) = Пс (12) (D) Пв (r1 ) - Пс (12) +Ø OB OD OA O C
List all nontrivial functional dependencies satisfied by the relation of Figure7.18.
not handwritten
Assume a relation schema R(a, b, c, d, e, f) with primary key (a, b) and the following full func- tional dependencies: d → f {a,b} → d {a,b} → f a → c b→ e Write down the result of normalizing R into 3rd normal form (no explanations needed). Declare primary and foreign keys in the resulting schemas. urvel I
i need the answer quickly
2. Consider the universal relation R = (A, B, C, D, E, F, G} and the set %3D of functional dependencies F = {{B, C) -> (A), (C) -> {D, E G}, (E} -> F}. What is the key for R? Decompose R into 2NF, then 3NF relations. %3D
Consider a relation schema R = (X, Y, Z) on which the following functional dependencies hold: {XYZ, Z-X}. Show that the schema R is not in BCNF (Boyce-Codd Normal Form) but it is in 3NF (Third Normal Form).
Please answer this question. Thank you!
Urgent
Defined the relational algebra operations as follows: SELECT (p, R) is equivalent to σp(R) referring to a set tuples of relation R that conforms to predicate p. PROJECT(L, R) is equivalent to πL(R) referring to a relation that contains a vertical subset of R, extracting the values of specified attributes L and eliminating duplicates. JOIN (R, p, S) refers to a relation containing a combination of tuples of relations R and S that satisfy the join condition p. FULL_JOIN (R, p, S) refers to a relation containing the result of outer join between relations R and S that satisfy the join condition p LEFT_JOIN (R, p, S) refers to a relation containing the result of left outer join between relations R and S that satisfy the join condition p RIGHT_JOIN (R, p, S) refers to a relation containing the result of right outer join between relations R and S that satisfy the join condition p CROSS (R, S) refers to a relation containing the catesian product of relations R and S. UNION (R, S)…
Given the reation R (A, B, C, D , E), with functional dependencies: A, B -> C D, E -> C B -> D Could you explain why this is not functional dependency preserving? Also could you work out the BCNF for this?