Scribd
Upload
11 views2 pages

Understanding BCNF in Databases

The document provides an overview of Boyce Codd Normal Form (BCNF), which is a database normalization method that ensures a relation is in BCNF by adhering to specific rules. It explains that a relation must first be in Third Normal Form (3NF) and that for any functional dependency, the left side must be a super key. An example illustrates how to identify and decompose a relation that is not in BCNF into two relations that meet the criteria.

Uploaded by

Bhabna De
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Understanding BCNF in Databases

The document provides an overview of Boyce Codd Normal Form (BCNF), which is a database normalization method that ensures a relation is in BCNF by adhering to specific rules. It explains that a relation must first be in Third Normal Form (3NF) and that for any functional dependency, the left side must be a super key. An example illustrates how to identify and decompose a relation that is not in BCNF into two relations that meet the criteria.

Uploaded by

Bhabna De
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

5/19/23, 10:37 AM BCNF Database Normalization | DBMS Tutorial | Minigranth

BOYCE CODD NORMAL FORM

Chapters

BCNF (Boyce Codd Normal Form) : Introduction


BCNF is known as “Boyce Codd Normal Form” and is a successor to “Third Normal Form”. It is used to check whether a
given relation is in “BCNF” or not.
Any relation to be in BCNF must follow below mentioned two rules.
1. The relation/table needs to be in 3NF.
2. For a functional dependency P  Q, “P” should be a super key.
BCNF deals with the cases where “Non-Prime in a functional dependency derives a prime attribute”. How? Let’s take an
example to clear this doubt.

BCNF : Example
Consider a relation R(X,Y,Z) having following functional dependencies :

FD1 : XY  Z

FD2 : Z  Y

Step-1 : Check whether given relation is in 3NF or not.


Attribute “Z” is fully dependent upon the candidate key “XY” and there is not transitive dependency too. Also, “X & Y” are
prime attributes whereas “Z & T” are non-prime attributes.

Step-2 : As it is confirmed that the relation is in 3NF, we can move further. Now, check for FD’s where a non-prime attribute
determines a prime attribute. In this example “Z  Y” is that FD.
FD1 : XY  Z (“XY” is the candidate key, so no problem in this FD)

FD2 : Z  Y (Here, a non-prime attribute is deriving a prime attribute)

Hence, we can conclude by observing “FD2” that this relation “R” is not in BCNF. Follow step-3 to convert this into BCNF.

Step-3 : Decompose the relation R(X,Y,Z,T) into R1(X,Y,Z) and R2(Z, Y) to convert the relation in BCNF.
R1 : XY  Z

R2 : Z  Y

[Link] 1/2
5/19/23, 10:37 AM BCNF Database Normalization | DBMS Tutorial | Minigranth

“XY” and “Z” are super keys of their respective relations i.e. “R1” and “R2” as each of them can uniquely determine the
attributes present in the relations.

Hence after decomposition, both the relations R1 and R2 are in BCNF.

 Previous Learn More 

All about Minigranth!!! Tutorials!


About Minigranth Computer Networks

The Story Core Java

Join Hands! DBMS

Suggestions SQL

Contact Us Software Testing

Privacy Policy More...

Test Your Skills!


C Language

Computer Networks

Core Java

More...

Let's Get Social

   

©Minigranth 2022 | All Rights Reserved. Handmade With  In India - Made for the World 

[Link] 2/2

You might also like