Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Suppose a relational schema R 2 ( A , B , C , D , E , F , G , H , I )

Suppose a relational schema R2(A, B, C, D, E, F, G, H, I) and set of functional dependee: { A,B C (
Suppose a relational schema R2(A, B, C, D, E, F, G, H, I) and set of functional dependencies
}
A,DG,H
B,DE,F
AI
{HJ
Identify all candidate keys for R2.
ABD is the candidate key, because closure of ABD has all the attributes of R. Prime attributes: A B D, Non-prime attributes: C E F G H I
Check out that R2 is in 3NF or not? If not decompose it in 3NF.
(1)-- Neither AB is super key, nor C is prime attribute.
(2)-- Neither AD is not super key, nor GH is prime attribute.
(3)-- Neither BD is not super key, nor EF is prime attribute.
(4)-- Neither A is not super key, nor I is prime attribute.
(5)-- Neither H is not super key, nor J is prime attribute.
So,R2 is not in 3NF as it is not following the rules of 3NF.
Therefore, R2(A,B,C,D,E) needs to be divided into following:
R21(A B C I)
R22(A D G H J)
R23(B D E F)
R24(A B D)
R211(A B C)
R212(A I)
R221(A D G H)
R221(H J)
END OF EXAM1)A,D G,HB,D E,FA IH J }
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Moving Objects Databases

Authors: Ralf Hartmut Güting, Markus Schneider

1st Edition

0120887991, 978-0120887996

More Books

Students also viewed these Databases questions