Single valued normalisation, Database Management System

Assignment Help:

Single Valued Normalisation

 Codd in the year 1972 formed three normal forms (1NF, 2NF, and 3NF). These were based on functional dependencies between the attributes of a relation. Later Codd and Boyce proposed another normal form known as the Boyce-Codd normal form (BCNF). The fourth and fifth normal forms are based on multivalue and join dependencies and were proposed soon.  In this part we will do normal forms till BCNF only. Fourth and fifth normal forms are afar the scope of this course. For all practical purposes, BCNF or the3NF are quite adequate since they remove the anomalies talk about for most common situations. It should be obviously understood that there is no obligation to normalise relations to the maximum possible level. Performance should be engaged into account and sometimes an organisation may take a decision not to normalise, say, beyond third normal form. But, it should be noted that such designs should be careful sufficient to take care of anomalies that would result as of the decision above.

Intuitively, the second and third normal forms are planned to result in relations such that each relation have information about only one thing (either an relationship or a entity). A sound E-R model of the database would make sure that all relations either give facts about an entity or about a relationship resulting in the relations that are get being in 2NF or 3NF.

Normalisation results in decomposition of the original relation. It should be noted that decomposition of relation has to be always rely on principles, such as functional dependence, that ensure that the original relation may be reconstructed from the decomposed relations if and when needed. Careless decomposition of a relation can result in loss of information. We will talk about this in detail in the later section. Let us now describe these normal forms in more detail.

 


Related Discussions:- Single valued normalisation

What is alternate key, What is Alternate Key Alternate Key: This is t...

What is Alternate Key Alternate Key: This is the candidate key which is not taken as the primary key of the table. They are named so because although not the primary key, the

Give concurrent sub states diagram for the classroom, Give Concurrent sub s...

Give Concurrent sub states diagram for the classroom and exam held. In Figure, simultaneous substrates have been taken. After passing Minor 1 test you could give Minor 2 test. T

Explain the disadvantages of using dbms, Explain the disadvantages of using...

Explain the disadvantages of using DBMS There could be a few disadvantages of using DBMS. As DBMS requires computers, we have to invest a good amount in acquiring the hardwa

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

Define single valued and multivalued attributes, Define single valued and m...

Define single valued and multivalued attributes.  Single valued attributes: attributes with a single value for a particular entity are known as single valued attributes.   M

What is database trigger, What is database Trigger? A database trigger ...

What is database Trigger? A database trigger is a PL/SQL block that can explained to automatically execute for insert, update, and delete statements against a table. The trigge

Apriori algorithm-find all frequent large itemsets, Your friend owns a comp...

Your friend owns a computer store in Yuen Long, selling Desktop and Notebook PCs and other computer peripherals. Having been rather successful with his business there, he decided t

State the objectives of object design, Determine the OBJECTIVES of  object ...

Determine the OBJECTIVES of  object design After passing through this unit, you should be able to: describe and apply concept of generalisation; understand and appl

Explain query execution plan, Explain query execution plan? - Optimizer...

Explain query execution plan? - Optimizer available in SQL Server optimizes code to be effectively executed. - A query execution plan demonstrates how this optimizer would r

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd