WEEK -5

Redundancy and Anomaly

DECOMPOSITION
Decomposition in a Database Management System (DBMS) refers to the process of breaking down a large relation
(table) into smaller, well-structured relations. This process is commonly associated with normalization, which is a series
of guidelines aimed at organizing the data in a relational database to minimize redundancy, dependency, and
anomalies.

DECOMPOSITION

LOSSY LOSSLESS
DECOMPOSITION DECOMPOSITION
Lossy Decomposition
Lossy decomposition is when a relation gets decomposed into multiple relational schemas, in such a
way that retrieving the original relation leads to a loss of information. Thus, a lossy decomposition is
bound to lose information.

Lossless-Join Decomposition

• A functional dependency (FD) is a relationship that exists between two attributes in a

database, typically the primary key and additional non-key attributes.
 • A dependency is denoted by an arrow "→".
• If C determines D functionally , then C→D.
• Functional dependency, indicated as C→ D, is a relationship between two sets of attributes, C and
D. In this case, C is referred to as the "determinant", and D is referred to as the "dependent".

AL N= 5 attributes
Al (11)
m = 1 n = 3 m= 1

n =
3 faz
·

Possible
.

Suporkeys
maximum
is
the
no
of
>
-
 Functional Dependencies Axioms

as
*

2 If 2 >
-

BY
f
- B d+ B
If
2
-
S4 = 2> -
Y
*

d >
By
-
C

an
attribute
can determine that
if we

> using
the function set ,
then
closed
let will
.

be
↓ I = z
attribute
-

f
closed "functional & A
O
Eac
>
dependey AG
At >
- A

L
L
C
N ->
= ACIB -

⑰ - Ad -

-
MCB
-
E AcBG)
-

C
A (Bht
q
= ALBGSH

D,
name) O
A( = ACBUIA
of (I .

subset
is a

>
- ID

con
exter am
q
3
2x >
-
I

left figUt
(left)

(Right)

>
- *

A
At >
-

>
AB
At
-

-Ai2
At
 f

-
 !

br

" PO POR

.. 9 - R

Ot -O

Y O >
-
O
I
R