Ajay kumar 11bsp2111 Sec e

The process of organizing data to minimize redundancy is called normalization. Normalization usually involves dividing large tables into smaller. in other words we can sat that what i understand 1. if data can be found in two places in a single database (direct redundancy) or calculated using data from different parts of the database is called data redundancy and minimize this thing is known as normalization without comprimising with data intergrity which is below mentioned. 2 consistent and satisfies data constraint rules is called data intergrity.

 some

examples of normalization. 1st Normal Form (1NF) There are no duplicated rows in the table. Each cell is single-valued (i.e., there are no repeating groups or arrays) 2nd Normal Form (2NF) Def: A table is in 2NF if it is in 1NF and if all nonkey attributes are dependent on all of the key 3rd Normal Form (3NF) Def: A table is in 3NF if it is in 2NF and if it has no transitive dependencies. Boyce-Codd Normal Form (BCNF)

Def: A table is in BCNF if it is in 3NF and if every determinant is a candidate key. A relation scheme R is in Boyce-Codd Normal Form (BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form a B, where a is a proper subset of R and B is a proper sub