Some P

oints to Note on Functional Dependencies, Minimal Co

rs, and 3NF/BCNF decompositions

•T

vial functional dependenc

s. non-tri

vial functional dependenc

unctional dependenc

→

vial if Y

he right hand side of the fd,

is a

subset of X.

xample, the functional dependenc

(S#, P#)

→

S#" is tri

vial because the set

{S#} (for the R.H.S. of the fd) is a subset of (S#, P#} (for the L.H.S. of the fd).

On the other hand, the functional dependenc

(S#, P#)

→

S#, Qty" is NON-tri

vial

because the set {S#, Qty} is NO

Tas

ubset of the attrib

ute set {S#, P#}.

•C

an we remo

ve a

ttrib

utes common to the L.H.S. and R.H.S. of a functional depen-

denc

NO, in general, we can NO

hat - namely

av e

"(X, Y)

→

X, Z", we can

imply remo

ve t

he attrib

ute "X" common to both the L.H.S. and R.H.S. of the

fd, and obtain "Y

→

Z".

xample, we may ha

ve "

(S#, P#)

→

Qty" and thus "(S#, P#)

→

S#, Qty" (by

augmentation rule).

r, f

rom "(S#, P#)

→

S#, Qty", we can NO

eri

ve "

→

Qty".

•W

hich functional dependenc

emo

Suppose we ha

ve a r

elation R(ABC) with functional dependencies F = {A

→

B, B

→

C, A

→

C}. W

an see that "A

→

C" can be deri

rom "A

→

B" and "B

→

C". Here

we should remo

ve "

→

C" when we construct minimal co

or F

since "A

→

C" can be deri

rom the remaining functional dependencies.

If we remo

→

B" or "B

→

C" instead of remo

ving "A

→

C", we w

ould not

be able to re-deri

ve t

he remo

ne from the remaining fd'

So the idea is to remo

ve t

he fd'

hich are deri

ble from the others, and k

eep

those fd'

sed in the process of deri

tion.

Resources

Top Categories

Product

Company