Eliminate redundant data, Database Management System

Assignment Help:

 Eliminate Redundant Data

In the "Database Relation" above, the primary key is made up of the D-ID and the Emp-ID. The database-name relies only on the D-ID. The similar database-name will appear redundantly every time its associated D-ID appears in the Database Relation. The database relation has redundancy, for example D-ID value 4 is oracle is repetitive twice. In addition, it also experiences insertion anomaly that is we cannot enter Sybase in the relation as no employee has that skill.

The deletion anomaly also exists. For instance, if we remove employee with Emp-ID 3; no employee with FoxPro knowledge lefts and the information that D-ID 3 is the code of FoxPro will be gone.

To avoid these troubles, we require second normal form. To achieve this, we isolate the attributes depending on both parts of the key from those depending only on the D- ID. This result in two relations: "Database" which gives the name for every D-ID,

and "Emp-database" which lists the databases for each employee. The employee relation is already in 2NF as all the EMP-ID determines all different attributes

Employee Relation

 Emp-ID

Emp-Name

1

Gurpreet Malhotra

2

Faisal Khan

3

Manisha Kukreja

4

Sameer Singh

 

Emp-database

Relation

Emp-ID

D-ID

2

1

4

2

3

3

1

4

4

4

 

 

 

 

Database Relation

D-ID

Database

1

Access

2

DB2

3

FoxPro

4

Oracle


Related Discussions:- Eliminate redundant data

Fragmentation, Differentiate between horizontal & mixed horizontal fragment...

Differentiate between horizontal & mixed horizontal fragmentation?

Explain odbc, Explain ODBC? ODBC - Open DataBase Connectivity (ODBC) e...

Explain ODBC? ODBC - Open DataBase Connectivity (ODBC) enable the integration of SQL along with a general-reasons programming language.

Describe integrity and security, Describe integrity and security? a)   ...

Describe integrity and security? a)      Domain constraint b)      Referential integrity A value that appears in one relation for a given set of attributes also appear fo

Define the division operation of relational algebra, Define the Division Op...

Define the Division Operation of Relational Algebra Let R be a relation comprising attributes (A1,...Ap,Ap+1,...An) and S comprising attributes (Ap+1,...An)  DEF: Division

Transactions t1 and t2 are in a deadlock, Evaluate: a.When transactions...

Evaluate: a.When transactions T1 and T2 are in a deadlock, one of the transactions will eventually implement to completion and let the other one continue implementation. b.

Compute natural join and outer join, For the relations R and S given below:...

For the relations R and S given below: R                      S A B C 1 4 7 2 5 8 3 6 9

Approachs of database management system, The Database Approach In ord...

The Database Approach In order to overcome the limits of a file system, a new approach was needed. Hence a database approach emerged. A database is a persistent collection of

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

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