LOSSLESS JOIN DECOMPOSITION

-
Normalization is the process of minimizing redundancy and eliminating anomalies from a relation or a set of relations.
 Decomposition of a relation is done when a relation is not in required normal form .
 
We can decompose a relation into two or more relations if decomposition is lossless join as well as dependency preserving.

 Upto 3rd normal form both of these decomposition properties we need to preserve. 

Given a relation R after decomposing R into R1 and R2  ,


If R1 join R2 =R ,then the decomposition is said to be lossless join decomposition .


If R1 join R2 is ⊃ R ,then the decomposition is said to be lossy decomposition .








Comments

Post a Comment

Popular posts from this blog

COMPUTER ORGANISATION & ARCHITECTURE TUTORIAL 1

-
Image
We can start learning basics of Computer Organisation & Architecture  .  Understand the difference between computer architecture & organisation first . BASIC OPERATIONAL CONCEPTS  We can discuss about various operations used for transferring and manipulating data BUS STRUCTURE We can consider definition of BUS also about way of transferring data through Bus . MEMORY LOCATIONS & ADDRESSING Understand the basics of System Memory ,way of storing data in memory.  W can discuss here about memory addresses and about Byte addressable memory .At the end we will get the idea about memory size specification and how to calculate the address of memory bytes . INSTRUCTION EXECUTION &STRAIGHT LINE SEQUENCING Understand what an instruction is ,then learn about how to complete the execution of a program which is present in main memory of the system by executing set of instructions one after another . Here consider , two situations of instruction execution ,sequential execution and 
Read more