Lossless-join decomposition, Database Management System

Lossless-Join Decomposition

 

Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be right. We show how a careless decomposition may lead to problems containing loss of information.

Consider the following relation

ENROL (stno, cno, date-enrolled, room-no, instructor)

Suppose we decompose the above relation into two relations enrol and enrol2 as follows:

ENROL1 (stno, cno, date-enrolled)

ENROL2 (date-enrolled, room-no, instructor)

There are troubles with this decomposition but we do not wish to focus on this aspect at the moment. Let a case of the relation ENROL be:

St no

cno

Date-enrolled

Room-no

Instructor

1123

MCS-011

20-06-2004

1

Navyug

1123

MCS-012

26-09-2004

2

Anurag Sharma

1259

MCS-011

26-09-2003

1

Preeti Anand

1134

MCS-015

30-10-2005

5

Preeti Anand

2223

MCS-016

05-02-2004

6

Shashi Bhushan

                                                              Figure:  A sample relation for decomposition

Then on decomposition the relations ENROL1 and ENROL2 would be:

St no

Cno

Date-enrolled

1123

MCS-011

20-06-2004

1123

MCS-012

26-09-2004

1259

MCS-011

26-09-2003

1134

MCS-015

30-10-2005

2223

MCS-016

05-02-2004

 

 

ENROL1

ENROL2

Date-enrolled

Room-no

Instructor

20-06-2004

1

Navyug

26-09-2004

2

Anurag Sharma

26-09-2003

1

Preeti Anand

30-10-2005

5

Preeti Anand

05-02-2004

6

Shashi Bhushan

All the information that was in the relation ENROL appears to be still existing in ENROL1 and ENROL2 but this is not so. Assume, we wanted to retrieve the student numbers of all students taking a course from Preeti Anand, we would require to join ENROL1 and ENROL2. For joining the only general attribute is Date-enrolled. Therefore, the resulting relation obtained will not be the similar as that of Figure. (Please do the verify and join the resulting relation).

The join will have a number of spurious tuples that were not in the unique relation. Because of these additional tuples, we have lost the correct information about which students take courses from Preeti Anand. (Yes, we have many tuples but less information because we are not capable to say with certainty who is taking courses from Preeti Anand). Such decompositions are known as lossy decompositions. Lossless or nonloss decomposition is that which surety that the join will result in exactly the similar relation as was decomposed. One might think that there may be other ways of recovering the unique relation from the decomposed relations but, sadly, no other operators can recover the unique relation if the join does not (why?).

We require to analyse why the decomposition is lossy. The general attribute in the above decompositions was Date-enrolled. The general attribute is the glue that provides us the ability to find the relationships among different relations by joining the relations simultaneously. If the general attribute have been the primary key of at least one of the two decomposed relations, the trouble of losing information would not have existed. The trouble arises because various enrolments may take place on the similar date.

Posted Date: 3/7/2013 2:21:06 AM | Location : United States







Related Discussions:- Lossless-join decomposition, Assignment Help, Ask Question on Lossless-join decomposition, Get Answer, Expert's Help, Lossless-join decomposition Discussions

Write discussion on Lossless-join decomposition
Your posts are moderated
Related Questions
Transactions And Concurrency Management  Introduction One of the main benefits of storing data in an integrated repository or a database is to permit sharing of it betwee

Outer Join: The use of Outer Join is that it still joins those tuples that do not have matching values in common columns are also contained in the result table. Outer join places

Company XYZ is an advertising company. It has its own website but the search facilities offered are not reliable. The company is willing to invest to acquire new machines and sof

PHYSICAL DBMS ARCHITECTURE  The physical architecture defines the software components used to process and enter data, and how these software components are related and interc

Q.   Explain  data aggregatio n and discuss different design constraints. Sol. Aggregation   One limitation of the E-R model is that it cannot express relationships amon

Gyan Gurukul is a software company that provides software related solution. Ashutosh Dubey who is the director of Gyan Gurukul want a three-level schema architecture for the Gyan G

What are multiple inheritances? Multiple inheritances allow a class to inherit variables and methods from many super classes.

Explain the Difference between DROP and DELETE DELETE deletes one or more than one tuples of a particular relation from the database. DROP is employed to remove a table from th

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

Give a sample of the Dynamic Model. The sample of dynamic model is given below:  Dynamic model for the car: Brake and Accelerator            Brake or Applies Accelerator