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

Multiple column queries-syntax, Multiple column Queries: Syntax: ...

Multiple column Queries: Syntax: SELECT COLUMN1, COL2,...... FROM TABLE WHERE (COLUMN1, COL2, ...) IN (SELECT COLUMN1, COL2,....  FROM TABLE WHERE );

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

What type of view of total database content, What type of view of total dat...

What type of view of total database content? Data base content Conceptual view of total database contain.

Failures and recovery, Failures and Recovery In practice various things...

Failures and Recovery In practice various things might occur to prevent a transaction from completing. Recovery methods are used to bring database, which does not satisfy consi

Process-oriented decompositions, Process-oriented decompositions Pr...

Process-oriented decompositions Process-oriented decompositions divide complex process, task or function into simpler sub processes until they get simple enough to be deal

Explain interblock gap, Explain Interblock gap? Interblock Gap - A trac...

Explain Interblock gap? Interblock Gap - A track of a disk is separated into equal-sized disk blocks. Blocks are separated through fixed-size gaps, called as interblock gaps th

Abap/4 statements to access internal tables without header, What should be ...

What should be declared explicitly in the corresponding ABAP/4 Statements to access internal tables without header lines & why? Work Area. This is needed as the Work Area is

Explain the process-oriented decomposition, Breaking into Subsystems D...

Breaking into Subsystems Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the

The transactions, The Transactions- A transaction is definite as the unit o...

The Transactions- A transaction is definite as the unit of work in a database system. Database systems that deal with a huge number of transactions are also termed as transaction p

Update operations in dbms - insert operation, Update Operations and Dealing...

Update Operations and Dealing with Constraint Violations There are three basic operations to be executes on relations: Insertion Deletion Update The INSER

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