8

8:

(normalization)

.

 8:

(data redundancy)
:
,
,
.

 8:

(functional
dependencies)
.
X Y XY
.
Y
(functional dependent)
X.
4

 8:

X,
Y.
.. ,

(trivial)
(. , )
.

 8:

Armstrong
1. (reflexive) :
Y X , XY.
2. (augmentation) :
XY, XZYZ.
3. (transitive) :
XY YZ , XZ.

 8:

Armstrong
Armstrong .
(sound and
complete) :

,
F+.

,

Armstrong.

 8:

4. (decomposition):
XYZ, XY XZ.
5. (union):
XY XZ , XY Z.
6. - (pseudotransitive) :
XY WYZ , WXZ.
7. (accumulative) :
XYZ ZBW, XYBW.
8. (general unification) :
XY ZW , X U (Z-Y)YW.
8

 8:

W, U, V, X, Y, Z
: WUV, UY, VXYZ.
: WXZ.
M WUV WV.
WXVX.
WXYZ.
WXZ.

 8:

F
(closure) F+.
G
(is covered)
F, G
F+.
F G
(equivalent) : F+=G+.
10

 8:

F+
F
( ).
AB
F+, F+.
X
(attribute closure), F,
11
X X+.

 8:

.12

 8:

-
F:
VYZ, VZW, WY, VYW.
:
VY, VZ, VZW, WY, VYW.

,
,
F
.
13

 8:

VY.
:
1: X=V.
2: X=VZ VZ.
3: X=VZW VZW.
3: X=VZWY WY.
3: .
4: Y VZWY,
VY (F-{VY})+ .
14

 8:

VZ :
1: X=V.
2: X=VY VY.
3: X=VYW VYW.
3: .
4: Z VYW,
VZ (F-{VZ})+ .
, ,

.
15

 8:

(extraneous)

.
XY F.
A :
AX F
(F {XY}) U {(XA)Y},
AY F
(F {XY}) U {X(Y-A)}.
16

 8:

F (minimal)
(irreducible) :
F
.
XY
ZY , Z X.
F F.

17

 8:

Fmin
(minimal cover) F,
Fmin F.

18

 8:

1KM (first normal form
1NF ) ,
.

.

19

 8:

2KM, 3KM Boyce-Codd
(BCNF)
( ).
(4KM, 5KM)
(multivalued)
(join).
(normalization)

.

, , .
20

 8:

:

,

.

:
(lossless join),
,
(dependency preservation)
.
21

 8:

1
(, ) ,

.
1
, .

(nested relations),
N1NF (non-first normal from).
22

 8:

-
_ _ _

12345678

{, , }

23456789

{}

34567890

{}

__ 1.
_ _ _

12345678

12345678

12345678

23456789

34567890

1 __.
23

 8:

.
_ _ _

12345678

{, , }

23456789

{}

34567890

{}

_ _

12345678

23456789

34567890

24

 8:

1 :
_(AT, , ((_, ))
: ,
_: , .

AT _
AT

AT _

25
.

 8:

(full) X: X{A}Y,
(partial).
1:

26

 8:

1 2
:

,

(all-key relation),
,
.

27

 8:

2
,
:

(.
).
28

 8:

3

(transitive)
R
.

.
,

.
29

 8:

3
:
_ _,
_ _.
.
:

30

 8:

Boyce-Codd
BCNF XY
X
.

BCNF XY
X (
) .


BCNF.
31

 8:

BCNF -
R(, , )
(, ).
,

,
.
( ),
.
R BCNF
.
32

 8:

BCNF -
R(, , )
.
R1(,) R2(,)
R1(,) R2(,)
R1(,) R2(,)

(,
).
?

33

 8:

BCNF
R AB
BCNF, R :
R1 AB ,
R2 (R).

R=(, , ),
( )
BCNF, :
R1(,)

R2(,) .
34

 8:

35

 8:

F R R1 R2.

F+:
R1 R2 R1 R2,
R1 R2 R2 R1

, :
XY YZ XY-YZ Y X,
XY YZ YZ- Y Z.

F+.

36

 8:

F R
R1, R2, , Rk.

tableau
.
,
A1, A2, , An R,
R1, R2,,Rk.
H (i,j) aj
Aj Ri,
bij.
37

 8:

XY,
X,
Y.


.
bij ai.

aj ( 1j n),
.
38

 8:

-
R(X,Y,Z,W)
F: XZ, YZ, ZW.

R : R1(X,Y), R2(Y,W),
R3(X,Y,Z).
.

39

 8:

XZ
:

:
ZW
:
aj,
40
.

 8:

(multivalued)
1,
.
R 3
A,B,C R, AB
B

A C.
AC.

,
, ,
.
41

 8:

42

 8:

1. (reflexive) :
Y X , XY.
2. (augmentation) :
X Y, XZ YZ.
3. (transitive) :
X Y Y Z , X Z.
4. (decomposition) :
XY, XZ, XYZ, XY-Z XZ-Y.
5. (union):
X Y X Z , X Y Z.
43

 8:

6. - (pseudotransitive) :
X Y WY Z, WX Z.

7. (complementation) :
X Y X R-(XY).
8. (coalescence) :
XY W
W Y= WZ Z Y, XZ.
9. (replication) :
X Y Y.
44

 8:

R 4
BCNF .

4 R

.
,
R R1 R2 :
R1 XY,
R2 RY.
45

 8:

-

4.

46

 8:

.
,
, .


F+:
R1 R2 R1R2
R1 R2 R2R1

.
5
47
.

 8:

(join dependencies)
R R1, R2, , Rn
R, R = R1 U U Rn.
R
R1,R2,,Rn.
, R
:

M
.
48

 8:

5KM
- (project-join normal form - PJNF)
.

,

.

49

 8:

R
, . :

,

,

.

,
.
50

 8:

51

 8:

52

 8:

, ,
.
(XY) Y X.

.

F ,
F+ .
()
. 1 5.
, BCNF,

53
.