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

Design an algorithm to implement operations, Design an algorithm to impleme...

Design an algorithm to implement operations  Each and every operation specified in the functional model could be formulated as an algorithm. The algorithm indicates how operat

Explain data abstraction, Explain data abstraction? Data abstraction Da...

Explain data abstraction? Data abstraction Data abstraction is a methodology in which enables us to isolate how a compound data object is utilized from the details of how it is

Define specialisation and generalization in brief, Define Specialisation an...

Define Specialisation and generalization in brief? Specialisation / generalization: Generalization or Specialization represents the is a relationship set, an necessary element

Relationship sets, A relationship set is a set of relationships of the simi...

A relationship set is a set of relationships of the similar type. For example, let consider the relationship among two entities sets course and student. Collection of all the in

List out user authorization to modify the database schema, List out various...

List out various user authorization to modify the database schema. a)  Index authorization b)  Resource authorization c)  Alteration authorization d)  Drop authorizat

State the meaning of self-transition, What is self-transition? ...

What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f

Describe the two alternatives for specifying structural, Describe the two a...

Describe the two alternatives for specifying structural constraints on relationship kinds? Relationship kinds have certain constraints in which limit the possible combination o

What is called an evaluation primitive, What is called an evaluation primit...

What is called an evaluation primitive? A relational algebra operation annotated with instructions on how to evaluate is known as an evaluation primitive.

Rules of data normalisation, Rules Of Data Normalisation  Let us now su...

Rules Of Data Normalisation  Let us now summarise Normalisation with the help of various clean rules. The following are the necessary rules for the Normalisation process: 1.

State the rearranging the execution order for efficiency, Define the step -...

Define the step - Rearranging the Execution Order for Efficiency As we know that algorithm and data structure are closely related to one another, but data structure is conside

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