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 deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

Extended e-r features, Although, the essential features of E-R diagrams are...

Although, the essential features of E-R diagrams are enough to design many database situations. Though, with more difficult relations and advanced database applications, it is need

Development of large scale distributed real systems, Question: (a) What...

Question: (a) What are the challenges in the development of Large Scale Distributed Real Systems? (b) What is backward engineering and forward engineering in a design packa

Tuples-attributes , Consider a relation s over the attributes A and B wit...

Consider a relation s over the attributes A and B with the following characteristics: 5,000 tuples with 10 tuples per page A 2-level B+ tree index on attribute

Define deadlock prevention, Define Deadlock prevention These protocols...

Define Deadlock prevention These protocols make sure that the system will never enter a deadlock state. There are two methods to deadlock prevention. One approach makes sure t

Include the create database command, Submit the SQL Statements necessary to...

Submit the SQL Statements necessary to create your database according to the following guidelines: Your SQL statements should exactly mirror your ERD. All primary keys,

Describe the responsibilities of the dba and the database, Describe the res...

Describe the responsibilities of the DBA and the database designer ? The responsibilities of DBA and database designer are: 1. Planning for the database's future storage needs

Drop table command, DROP TABLE Command: When an existing object is not ...

DROP TABLE Command: When an existing object is not needed for further use, it is always better to eliminate it from the database. To remove the existing object from the databas

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

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