Co So Du Lieu

mc lc
li ni u 3
Phn th nht: tm tt l thuyt v bi tp
6
Ch-ng 1: quan h v i s quan h
7
Ch-ng 2: cc thao tc trn b v quan h 21
Ch-ng 3: ngn ng hi sql
26
Ch-ng 4: ph thuc hm 31
Ch-ng 5: chun ho 47
mt s thi
53
Phn th hai: bi gii
60
Bi gii ch-ng 1: quan h v i s quan h
61
Bi gii ch-ng 2: cc thao tc trn b v quan h
67
Bi gii ch-ng 3: ngn ng hi sql
75
Bi gii ch-ng 4: ph thuc hm
82
Bi gii ch-ng 5: chun ho
102
Nguyn Xun
Huy, L Hoi Bc, Bi tp C s d liu
_________________________________________________________________
___

3
Bi gii cc thi
109
Nguyn Xun
_________________________________________________________________
___

4

li ni u

Khc vi ton hc, trong t sch tin hc n-c nh,
ta ch thy mt s sch bi tp lp trnh. chc
chn l mt thit thi cho sinh vin v cc bn t
hc.
Cun Bi tp c s d liu ny l mt th nghim
nhm tr gip cc bn tr mt ph-ng thc t kim
tra v nh gi tri thc ban u, mc nhp mn, v
mt lnh vc chim v tr ng ni trong qu trnh
pht trin ca cng ngh thng tin.
Nhng nm gn y, trong cc k thi tt nghip i
hc, thi chuyn i, thi tuyn cao hc v nghin
cu sinh u c mng v c s d liu. l iu
d hiu, v c s d liu l phn khng th thiu
trong cc h thng tin hc ho.
Trong ph-ng n u tin ca cun sch chng ti
chn lc v xut mt s bi tp thuc nm mng
tri thc sau y: i s quan h, cc php ton
trn b, ngn ng hi SQL, ph thuc hm v chun
ho. Mi mng tri thc -c trnh by thnh ba
phn: Phn th nht bao gm mt s iu tm tt v
l thuyt. Phn tip theo l cc bi tp, cui cng
l cc bi gii. Du * -c dng ghi ch cc bi
tp mc nng cao.
Phn cui sch chng ti tuyn chn v gii thiu
mt s thi tuyn cao hc v nghin cu sinh
bn c lm quen vi cc ni dung tng hp.
Mc tiu cui cng ca vic ra bi tp l gip cho
ng-i hc hiu su v k hn v cc khi nim
hc. t -c iu ny mong bn c ng b qua
Nguyn Xun
_________________________________________________________________
___

5
bi tp no. Vi cc bi d, bn c th gii trong
mt vi pht. Vi cc bi kh, trong ln luyn tp
th nht bn c th b qua. Sau mt vi ln th
sc, tin rng bn s hon ton lm ch -c cc
khi nim lin quan n c s d liu.
Chng ti cho rng cc ti liu sau y s gip ch
bn c tra cu cc ngun tri thc c s:
1. Date C. J., Nhp mn cc h c s d liu, Nhng
ng-i dch: H Thun, Nguyn Quang Vinh, Nguyn
Xun Huy, NXB Thng K, H Ni, Tp I (1985), Tp
II (1986).
2. Nguyn Xun Huy, Thut ton, NXB Thng K, H
Ni, 1987.
3. V c Thi, C s d liu:Kin thc v thc
hnh, NXB Thng K, H Ni, 1997.
4. L Tin V-ng, Nhp mn c s d liu quan h,
Ti bn ln th 4, NXB Thng K, H Ni, 1999.
5. Garcia-Molina H., Ullman J., Widom J., Database
System: The Complete Book, Prentice Hall, 2002.
6. Maier D., The Theory of Relational Database,
Computer Science Press, Rockville, Md, 1983.
7. Ullman, J., Principles of Data-base and
Knowledge-base Systems, (Second Edition), Computer
Science Press, Potomac, Md., 1982, (C bn dch
ting Vit ca Trn c Quang.)
Ng-i u tin nh h-ng cho chng ti tm hiu v
c s d liu v lun lun khuyn khch chng ti
hc tp v trao i kin thc l gio s- H Thun,
Vin Cng ngh Thng tin.
Cun sch ny -c khi tho v hon thnh theo
ph-ng n u tin l nh nhit tnh ng gp v
t-ng, ni dung v thm nh ca cc ng nghip
ca chng ti. Gio s- L Tin V-ng, Tng cc a
chnh, gio s- Hong Kim, gio s- Trn Vnh Ph-c,
i hc Quc gia thnh ph H Ch Minh tho lun
Nguyn Xun
_________________________________________________________________
___

6
chi tit v nhng ni dung c bn v kin trc cho
tp sch.
c bit, cc ng nghip tr, gio s- V Ngc
Lon, i hc Quc gia H Ni, gio s- Nguyn Thanh
Thu, i hc Bch khoa H Ni, tin s Trnh nh
Thng, i hc S- phm H Ni II, tin s D-ng Anh
c, tin s Vn Nhn, thc s Nguyn Tn Trn
Minh Khang, i hc Quc gia thnh ph H Ch Minh,
thc s Nguyn Xun Tng, Trung tm Tin hc B-u
in H Ni, thc s Nguyn Ngc H, Trung tm Tin
hc B-u in Hi Phng, thc s Trnh Thanh Lm,
Intel, thc s Nguyn Xun Hong, Misa Group c
nhng gp c th v ni dung ch-ng trnh o to
v cc yu cu thc tin ca c s d liu. Cc c
nhn Bi Thu Hng v Trn Quc Dng, Vin Cng
ngh Thng tin gip chng ti c li v chnh
sa cc trang bn tho.
Chng ti chn thnh cm n nhng ng gp v gi
ca cc ng nghip.
Chng ti mong rng s tip tc nhn -c nhng
kin ch gio ca bn c gn xa v ni dung v cu
trc ca tp sch.

Ct B, Ma Hoa Ph-ng,
2003
Cc tc gi
Nguyn Xun Huy
L Hoi Bc

Nguyn Xun
_________________________________________________________________
___

7

Phn 1

Tm tt l thuyt
&
Bi tp

Nguyn Xun
_________________________________________________________________
___

8

Ch-ng 1
Quan h v i s quan h

tm tt l thuyt

Quan h

Cho tp hu hn U = {A
1
, A
2
, ... , A
n
} khc trng
(n > 1). Cc phn t ca U -c gi l thuc tnh.
ng vi mi thuc tnh A
i
e U, i = 1,2, ..., n c
mt tp khng rng dom(A
i
) -c gi l min tr ca
thuc tnh A
i
.
t ) (
1
Ai
n
i
dom D

=
=
Mt quan h R vi cc thuc tnh U = { A
1
, A
2
, ...
, A
n
}, k hiu l R(U), l mt tp cc nh x t : U
D sao cho vi mi A
i
e U ta c t(A
i
) e dom(A
i
).
Mi nh x -c gi l mt b ca quan h R.
Mi quan h R(U) c hnh nh l mt bng, mi ct
ng vi mt thuc tnh, mi dng l mt b.
Ta k hiu t / U l mt b trn tp thuc tnh U.
Mt quan h trng, k hiu C, l quan h khng cha
b no.

Ch

V mi quan h l mt tp cc b nn trong quan h
khng c hai b trng lp.

Cc k hiu c bn

Nguyn Xun
_________________________________________________________________
___

9
Theo truyn thng ca l thuyt c s d liu chng
ta chp nhn cc quy nh sau y:
- Cc thuc tnh -c k hiu bng cc ch LATIN
HOA u bng ch A, B, C,...
- Tp thuc tnh -c k hiu bng cc ch LATIN
HOA cui bng ch X, Y, Z,...
- Cc thuc tnh trong mt tp -c lit k nh-
mt xu k t, khng c cc du biu din tp,
chng hn ta vit X = ABC thay v vit X = { A,
B, C }. XY biu din hp ca hai tp thuc tnh
X v Y, X Y. Php tr hai tp hp X v Y
-c k hiu l X-Y hoc X \ Y.
- Cc b -c biu din bng cc ch Latin th-ng
c th km ch s t, u, v, t
1
...
- Vi mi b t trong quan h R(U) v mi tp con
cc thuc tnh X _ U ta k hiu t[X] hoc
t.X l hn ch ca b t trn tp thuc tnh X.
- Hm Attr(R) cho tp thuc tnh ca quan h R.
- Hm Card(R) cho lc l-ng (s b) ca quan h R.
- Trong tr-ng hp tp thuc tnh U cho tr-c
ta c th vit n gin R thay cho R(U).
- K hiu REL(U) l tp ton th cc quan h trn
tp thuc tnh U.

Hai quan h R v S -c gi l t-ng thch nu
chng c cng mt tp thuc tnh, tc l nu
Attr(R) = Attr(S).

Vi mi b u trong quan h R(U) v mi b v trong
quan h S(V) ta k hiu u-v l php dn b. u-v cho
ta b t trn tp thuc tnh UV tho iu kin: t.U
= u v t.V = v.
Vi mi b u trong quan h R(U) v vi mi quan h
S(V) ta k hiu u-S l php dn b u vi quan h S.
u-S cho ta quan h
Nguyn Xun
_________________________________________________________________
___

10
P(UV) = { u-v | v e S }

th hin cc php ton quan h ta s dng cc k
php ta nh- k php ca h ISBL (Information
System Base Language).

i s quan h

Php chn (php lc)

Cho quan h R(U) v biu thc iu kin (cn gi l
biu thc lc hay biu thc chn) e. Php chn trn
quan h R theo iu kin e, k hiu R(e) cho ta
quan h:
P(U) = R(e) = { t e R | Sat(t, e) }
trong hm logic Sat(t, e) kim tra b t tho
iu kin e -c xc nh nh- sau:

1. Thay mi xut hin ca mi thuc tnh A trong
biu thc chn e bng tr t-ng ng ca A trong
b t, t.A, ta thu -c mt mnh logic b.
2. Tnh tr ca b. Nu l ng (True) th b t
tho iu kin e; ng-c li, nu tr ca b l
sai (False) th b t khng tho iu kin e.

Trong cc biu thc chn ta s dng k hiu cho cc
php ton logic nh- sau:

- Tch: & hoc AND
- Tng: | hoc OR
- Ph nh: ! hoc NOT
- Ko theo: hoc IMPLY

Php chiu

Php chiu quan h R(U) trn tp con thuc tnh X _
U, k hiu R[X], cho ta quan h
Nguyn Xun
_________________________________________________________________
___

11
P(X) = R[X] = { t.X | t e R }
R[X] -c tnh theo 2 b-c nh- sau:

1. Xo cc ct khng thuc X ca bng R,
2. Xo bt cc dng ging nhau trong bng kt qu:
ch gi li mt dng trong s cc dng ging
nhau.

Php kt ni t nhin

Php kt ni (t nhin) hai quan h R(U) v S(V),
k hiu R-S, cho ta quan h cha cc b -c dn t
cc b u ca quan h R vi mi b v ca quan h S
sao cho cc tr trn min thuc tnh chung (nu c)
ca hai b ny ging nhau.
P(UV) = R-S = { u-v | u e R, ve S, u.M = v.M, M = U
V }
Nu M = U V = C, R-S s cho ta tch Descartes
trong mi b ca quan h R s -c ghp vi mi
b ca quan h S.

Php cng (hp)

Php cng (hp theo l thuyt tp hp hoc kt ni
dc) hai quan h t-ng thch R(U) v S(U), k hiu
R+S, cho ta quan h cha cc b ca mi quan h
thnh phn,
P(U) = R+S = { t | t e R v t e S }

Php tr

Php tr (theo l thuyt tp hp hoc ly phn
ring) hai quan h t-ng thch R(U) v S(U), k
hiu R-S, cho ta quan h cha cc b ca quan h R
khng c trong quan h S,
P(U) = R-S = { t | t e R, t e S }

Nguyn Xun
_________________________________________________________________
___

12
Php giao

Php giao (theo l thuyt tp hp hoc ly phn
chung) hai quan h t-ng thch R(U) v S(U), k
hiu R&S, cho ta quan h cha cc b xut hin
ng thi trong c hai quan h thnh phn,
P(U) = R&S = { t | t e R, t e S }

Cc php ton cng, tr v giao c gi l cc
php ton tp hp trn cc quan h (t-ng thch).

Php chia

Cho hai quan h R(U) v S(V). Php chia quan h R
cho quan h S, k hiu R : S, cho ta quan h
P(M) = R : S = { t.M | teR, (t.M)-S _ R, M = U - V
}

Th t thc hin cc php ton quan h

Trong mt biu thc quan h cc php ton mt ngi
c -u tin cao hn (do -c thc hin sm
hn) cc php ton hai ngi. Tip n l nhm cc
php ton kt ni, giao v chia, cui cng l nhm
cc php ton cng v tr. Th t -u tin t cao
n thp ca cc php ton quan h -c lit k nh-
sau:
( ) , [ ]
- , & , :
+ , -

Dy cc php ton cng th t -u tin -c thc
hin ln l-t t tri qua phi. Nu biu thc quan
h c cha cc cp ngoc ( ) th cc biu thc con
trong cc cp ngoc -c thc hin tr-c.
Nguyn Xun
_________________________________________________________________
___

13

Mt s hm tin ch

1. Sum(R,A): cho tng cc gi tr s trong thuc
tnh (ct) A ca quan h R, Sum(R,A) = E ( t.A
| t e R )
2. Avg(R,A): cho trung bnh cng cc gi tr trong
thuc tnh (ct) A ca quan h R, Avg(R,A) =
Sum(R,A) / Card(R) nu Card(R) = 0
3. Max(R ,A): cho gi tr ln nht trong thuc
tnh (ct) A ca quan h R.
4. Min(R,A): cho gi tr nh nht trong thuc tnh
(ct) A ca quan h R.

Nu trong biu thc quan h c cha cc hm tin
ch th cc hm ny -c thc hin sm nht trong
ng cnh cho php.

Th d

Biu thc quan h P = S-R(A > Avg(S,A))[AB] s -c
thc hin theo trt t sau y:

1. Tnh hm c = Avg(S,A)
2. Thc hin php chn P
1
= R(A > c)
3. Thc hin php chiu P
2
= P
1
[AB]
4. Thc hin php kt ni P = S-P
2

Ch : Trong mt s ti liu c s dng k php
khc cho cc php ton quan h nh- sau

Php ton K hiu K hiu
khc
Chn R(e)
o
e
(R)
chiu R[X]
t
X
(R)
Nguyn Xun
_________________________________________________________________
___

14
kt ni t
nhin
R - S
R S
Cng R + S
R S
Giao R & S
R S
Tr R - S R \ S
Chia R : S
R S

C s d liu minh ha: CSDL Thc tp

Hu ht bi tp trong ch-ng ny lin quan n CSDL
Thc tp gm ba quan h sau y:

SV(SV#, HT, NS, QUE, HL)
DT(DT#, TDT, CN, KP)
SD(SV#, DT#, NTT, KM, KQ)

- Quan h SV(SV#, HT, NS, QUE, HL) cha thng tin
v cc sinh vin trong mt lp ca mt tr-ng i
hc,

SV - tn quan h sinh vin
SV# - m s sinh vin
HT - h v tn sinh vin
NS - nm sinh ca sinh vin
QUE - qu (tnh)
HL - hc lc th hin qua im trung bnh

- Quan h DT(DT#, TDT, CN, KP) cha thng tin v
cc ti nh tr-ng qun l,

DT - tn quan h ti
DT# - m s ti
TDT - tn ti
CN - h v tn ch nhim ti
KP - kinh ph cp cho ti (triu ng).

Nguyn Xun
_________________________________________________________________
___

15
- Quan h SD(SV#, DT#, NTT, KM, KQ) cha thng tin
v tnh hnh thc tp ca cc sinh vin theo cc
ti,

SD - tn quan h sinh vin - ti
SV# - m s sinh vin
DT# - m s ti m sinh vin tham gia
NTT - ni thc tp trin khai ti (tnh)
KM - khong cch t ni thc tp n tr-ng
KQ - kt qu thc tp theo ti chn

- Gi thit l mt sinh vin c th tham gia nhiu
ti, mi ti sinh vin thc tp ti mt
i im.

- Vi mi cu hi, yu cu tr li bng mt biu
thc ca i s quan h. Tui -c tnh n nm
2003. Th d,

Cu hi

Cho danh sch cc sinh
vin tr (d-i 18 tui tnh n nm 2003), hc v
thc tp u t loi kh/gii (im khng d-i
8.5)

Tr li

(SD(KQ >= 8.5)[SV#]-SV)(2003-NS < 18 & HL >=
8.5)[HT]

Bi tp

1.1. Cho hai quan h R(A,B,C,D) v S(C,D) nh- sau

R(A B C D)
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
a 4 x 2
c 5 y 7
S(C D)
x 1
y 2

Nguyn Xun
_________________________________________________________________
___

16

Hy xc nh:
a) R[AB]
b) R(3-B+D >1)
c) R(B < 4) + R(D > 3)
d) R(B >= 1 & B <= 5)
e) R-S[C]
f) R(B < 4) - R(D > 3)
g) R(B < 4) & R(D > 3)
h) R : S

1.2. Cho thng tin v nhng sinh vin sinh tr-c
nm 1983, qu Hi Phng?

1.3. Cho danh sch cc tnh c sinh vin n thc
tp?

1.4. Cho bit cc a im thc tp xa tr-ng (KM >
100) ca ti s 7?

1.5. Cho thng tin v vic thc tp ti Nha Trang
ca cc sinh vin?

*1.6. Cho danh sch sinh vin thc tp ti qu nh?

1.7. Cho thng tin v cc ti c sinh vin thc
tp?

1.8. Cho bit m ca cc ti khng c sinh vin
no tham gia?

Nguyn Xun
_________________________________________________________________
___

17
1.9. Cho bit m ca nhng ti c kinh ph 1.5
triu v nhng ti c kinh ph trn 2 triu?

1.10. Cho bit m ca nhng sinh vin d-i 20 tui,
thc tp kh (c im kt qu trn 7)?

*1.11. Cho bit m ca nhng ti c a bn thc
tp t ra l nh- ti 1.

*1.12. Cho danh sch nhng ti -c trin khai
thc tp tt c cc t nh c sinh vin thc
tp.

*1.13. Cho danh sch nhng sinh vin thc tp theo
ti c kinh ph ln hn mt phn nm tng kinh
ph cp cho cc ti.

*1.14. Cho danh sch cc sinh vin c im hc tp
cao hn im thc tp trung bnh ca ti m s
4.

1.15. Mt php ton 2 ngi u c tnh cht giao hon
nu:
( R, S): R u S = S u R
hoc c hai v ng thi khng c ngha.

Chng minh rng cc php ton quan h kt ni, cng
v giao c tnh giao hon.

1.16. Tm th d chng t cc php ton tr v chia
khng c tnh giao hon.

1.17. Cho quan h R(U) v hai biu thc chn e v
h. Chng minh

a) R(e & h) = R (h & e)
b) R(e & h) = R (e) & R(h) _ R(e)
Nguyn Xun
_________________________________________________________________
___

18
c) R(e & h) = R(h) & R(e) _ R(h)
d) R(e & h) = R(e)(h)
e) R(e | h) = R(h | e)
f) R(e | h) = R(e) + R(h)
g) R(! e) = R- R(e)
h) R(True) = R
i) R(False) = C

1.18. Cho quan h R(U), cc biu thc chn e, h
trn U v tp con cc thuc tnh X _ U. K hiu
Attr(e) l tp cc thuc tnh ca U c mt trong e.
Chng minh, nu Attr(e) _ X th
a) R(e)[X] = R[X](e)
b) R(h & e)[X] = R(h)(e)[X] = R(h)[X](e)

*1.19. Chng minh rng php chia c th -c biu
din qua cc php chiu, kt ni v tr nh- sau,
R : S = R[M] - (R[M]-S - R)[M]
trong M = Attr(R) - Attr(S).

1.20. Php ton quan h -c gi l ng nu vi
mi quan h u vo ta u thu -c u ra l mt
quan h. Cho bit tnh ng (ghi c / khng) ca
cc php ton quan h

Php ton K hiu Tnh ng
chn ( )
chiu [ ]
kt ni t
nhin
-

cng +
giao &
tr -
Nguyn Xun
_________________________________________________________________
___

19
chia :

1.21. Php ton 2 ngi u c tnh cht kt hp nu:
( R, S, T): (R u S) u T = R u (S u T)
hoc c hai v ng thi khng c ngha.
Chng minh rng cc php ton kt ni, cng v
giao ca i s quan h c tnh cht kt hp.

1.22. Tm th d chng t cc php ton tr v chia
khng c tnh kt hp.

1.23. Chng minh rng vi mi cp quan h t-ng
thch R v S ta c

R - (R - S) = R & S

1.24. Chng minh rng vi mi quan h R(U), mi tp
con X trong U v mi biu thc iu kin e ta c
a) R(e)(e) = R(e)
b) R[X][X] = R[X]

1.25. Chng minh rng vi mi quan h R(U) ta c
a) R - R = R
b) R + R = R
c) R & R = R
d) R - R = C
e) R : R = C, Attr(R : R) = C .

1.26. Php ton quan h -c gi l n (co) ngang
nu quan h kt qu c s thuc tnh nhiu hn (t
hn) cc quan h u vo, -c gi l n (co) dc
nu quan h kt qu c s b nhiu hn (t hn) cc
quan h u vo. Hy nh du (+), (-) hoc (=)
Nguyn Xun
_________________________________________________________________
___

20
khng nh tnh n hoc co hoc khng n/co ca mi
php ton t-ng ng.

1.27. Cho quan h R(U) v e v h l hai biu thc
chn trn U. Chng minh, nu e h th:
a) R(e)(h) = R(e)
b) R(e) _ R(h)

1.28. Gi T v F ln l-t l cc cng thc logic
hng ng v hng sai. Chng minh rng vi mi quan
h R ta c:
a) R(T) = R
b) R(F) = C

*1.29. Cho quan h R(U). Hy dng mt php ton
quan h sinh ra quan h rng S(U).

1.30. Chng minh rng vi mi quan h R(U) v mi
tp thuc tnh X v Y tho iu kin X _ Y _ U th
R[Y][X] = R[X]

1.31. Cho hai quan h R(U) v S(V) v hai biu thc
chn e trn U, h trn V. Chng minh
(R-S)(e

& h) = R(e)-S(h)
Php ton K
hiu
N/Co
ngang
N/Co dc
chn ( )
chiu [ ]
kt ni t
nhin
-

cng +
giao &
tr -
chia :
Nguyn Xun
_________________________________________________________________
___

21

1.32. Cho cc quan h R(U), S(V) v cc tp thuc
tnh X _ U, Y _ V. Bit Z = U V. Chng minh

(R-S)[XZY] = R[XZ]-S[ZY]

*1.33. Cho quan h R(U) v cc tp con X
1
, X
2
, ...,
X
k
tho iu kin X
1
X
2
... X
k
= U . Chng minh

R[X
1
] - R[X
2
] - ... - R [X
k
] _ R

Tm th d chng t R[X
1
] - R[X
2
] - ... - R [X
k
] =
R

*1.34. Cho quan h R(U) v hai tp con thuc tnh X
_ Y _ U. Chng minh
a) R[U] = R
b) R [X] - R [X] = R[X]
c) R[Y] - R[X] = R[Y]
d) R - R[X] = R

*1.35. Cho tp hu hn cc phn t M. K hiu
Poset(M) l tp cc tp con ca M. nh x f:
Poset(M) Poset(M) -c gi l ng nu f tho ba
tnh cht sau
X, Y e Poset(M):
(C1) Tnh phn x: f(X) _ X
(C2) Tnh ng bin: nu X _ Y th f(X) _ f(Y)
(C3) Tnh lu ng: f(f(X)) = f(X)

Cho tp thuc tnh U. C nh cc tp con X
1
,
X
2
,..., X
k
ca U tho iu kin X
1
X
2
... X
k
=
U.
Nguyn Xun
_________________________________________________________________
___

22

Xt nh x : REL(U) REL(U)

R e REL(U): (R) = R[X
1
] - R[X
2
] - ... - R[X
k
]

Chng minh l mt nh x ng trn REL(U).

*1.36. (Nghch l giao hon-kt hp) Ta bit
php kt ni t nhin (-) c tnh kt hp v giao
hon. Xt cc quan h SV, DT v SD trong c s d
liu Thc tp. Hai quan h SV v DT khng c thuc
tnh chung, trong khi hai quan h SV v SD chung
nhau thuc tnh SV# v hai quan h SD v DT chung
nhau thuc tnh DT#. Gii thch v sao

SV - (SD - DT) = (SV - SD) - DT = (SV - DT) - SD

Cho bit kt qu ca php kt ni (SV - DT) trong
biu thc phi.

Nguyn Xun
_________________________________________________________________
___

23

Ch-ng 2

Cc thao tc trn b v quan h

Tm tt l thuyt

Trong phn trnh by c php ca cc cu trc iu
khin (cu lnh) v cc hm thao tc trn b v
quan h d-i y phn vit trong [ ] l tu chn.

(T1) for each t in R [with e] do P endfor

Thc hin ton t P trn nhng b t ca quan h R
[nu tho iu kin e].

(T2) if e then P[else Q] endif

Nu iu kin e tho th thc hin P [nu khng,
thc hin Q]

(T3) Create(R,X)

To lp quan h rng R (khng cha b no) vi tp
thuc tnh X cho tr-c.

(T4) Attr(R)

Hm cho tp thuc tnh ca quan h R .

(T5) Card(R)

Hm cho bit lc l-ng (s b) ca quan h R.

(T6) t [not_]in R
Nguyn Xun
_________________________________________________________________
___

24

Hm cho gi tr True nu b t [khng] c trong quan
h R, ng-c li hm cho gi tr False.

(T7) add t to R

Np b t vo quan h R.

(T8) t[X] hoc t.X

To b mi t b t vi tp thuc tnh X. B mi
bao gm cc gi tr ca mi thuc tnh A trong t, A
e X.

(T9) t/X

To b mi t b t bng cch b i nhng gi tr
ca mi thuc tnh A trong t, A e X.

(T10) u-v

To b mi bng php dn b v vi b u. Cc gi tr
trn min thuc tnh chung ca hai b u v v phi
bng nhau v ch ly mt trong hai tr bng nhau
trn mi thuc tnh chung.

Cc thut ton -c din t thng qua ngn ng quy
-c sau y

Algorithm <tn thut ton>
Format
Input
Output
Method

// Ch thch -c vit sau hai gch nghing
End.
Nguyn Xun
_________________________________________________________________
___

25

Bi tp

2.1. Vit thut ton thc hin php chn trn quan
h: R(e).

2.2. Vit thut ton thc hin php chiu trn quan
h: R[X].

2.3. Vit thut ton thc hin php kt ni t
nhin hai quan h: R-S.

2.4. Vit thut ton thc hin php hp hai quan
h t-ng thch: R+S.

2.5. Vit thut ton thc hin php giao hai quan
h t-ng thch: R&S.

2.6. Vit thut ton thc hin php tr hai quan h
t-ng thch: R-S.

2.7. Vit thut ton thc hin php chia hai quan
h: R:S.

2.8. Php chn_chiu quan h R(U) theo biu thc
chn e v trn tp con thuc tnh X _ U cho ta quan
h
Nguyn Xun
_________________________________________________________________
___

26
P(X) = R(e,X) = R(e)[X] = { t.X | t e R, Sat(t,e)
}

Vit thut ton thc hin trc tip php
chn_chiu.

2.9. Php kt_ni_chn_chiu hai quan h R(U) v
S(V) theo biu thc chn e v trn tp con thuc
tnh X _ UV cho ta quan h

P(X) = (R-S)(e,X) = (R-S)(e)[X] =
= { (u-v).X | ueR, veS, u.M = v.M, M = U V,
Sat(u-v,e) }

Vit thut ton thc hin trc tip php
kt_ni_chn_chiu.

2.10. Ci t hm Card(R): cho lc l-ng (s b)
ca quan h R.

2.11. Ci t hm Sum(R,A): cho tng cc gi tr
trong thuc tnh (ct) A ca quan h R: Sum(R,A) =
eR t
A t. .

2.12. Ci t hm Avg(R,A): cho trung bnh cng cc
gi tr trong thuc tnh (ct) A ca quan h R,

Avg(R,A) = Sum(R,A) / Card(R), nu Card(R)= 0

2.13. Ci t hm Max(R, A): cho gi tr ln nht
trong thuc tnh (ct) A ca quan h R.

2.14. Ci t hm Min(R, A): cho gi tr nh nht
trong thuc tnh (ct) A ca quan h R.

Nguyn Xun
_________________________________________________________________
___

27
2.15. Ci t hm Sum(R,A,e): cho tng cc gi tr
trong thuc tnh (ct) A ca quan h R xt trn
nhng b tho iu kin e,
Sum(R,A,e) = Sum(R(e),A) =
e
) , (
.
e t sat
R t
A t .

2.16. Ci t hm Count(R,e): cho s l-ng cc b
tho iu kin e trong quan h R.

2.17. Ci t hm Avg(R,A,e): cho trung bnh cng
ca cc gi tr khng nht thit khc nhau trong
thuc tnh (ct) A ca quan h R xt trn nhng b
tho iu kin e.

2.18. Ci t hm Maxe(R, A, e): cho gi tr ln
nht trong thuc tnh (ct) A ca quan h R xt
trn nhng b tho iu kin e.

2.19. Ci t hm Mine(R, A,e): cho gi tr nh
nht trong thuc tnh (ct) A ca quan h R xt
trn nhng b tho iu kin e.
Nguyn Xun
_________________________________________________________________
___

28

Ch-ng 3

ngn ng hi sql
(Structured Query Language)

tm tt l thuyt

SQL l ngn ng hi thuc lp ngn ng cc php
tnh trn b.
Cu trc chnh ca SQL c dng

SELECT [DISTINCT/UNIQUE] X
FROM R
1
, R
2
,...,R
k
WHERE e;

trong X l danh sch cc thuc tnh ca quan h
ra, R
1
, R
2
,...,R
k
l cc quan h, e l iu kin.
Cu trc trn t-ng -ng vi biu thc i s quan
h sau y

(R
1
- R
2
-. . .-R
k
)(e)[X]

trong php - -c hiu l php kt ni c iu
kin. iu kin ny -c xc nh trong mc WHERE.

Khi lit k tn cc thuc tnh, trnh hin t-ng
trng tn ca hai thuc tnh trong hai quan h khc
nhau ta c th ch r quan h cha thuc tnh .
Th d, R.A ni v thuc tnh A ca quan h R. T
kho DISTINCT l ch th l-c bt cc b trng lp
kt qu.

Cc t kha v k hiu

* - danh sch y cc thuc tnh
Nguyn Xun
_________________________________________________________________
___

29
IN - l phn t ca
NOT IN - khng phI l phn t ca
ANY - mt phn t, mt xut hin
ALL - vi mi
AND - php nhn logic
OR - php cng logic
NOT - php ph nh
ORDER BY DESC/ASC - sp gim/tng
GROUP BY - nhm theo
CONTAINS - cha
UNION - hp hai quan h t-ng thch
INTERSECTION - giao hai quan h t-ng thch
DIFFERENCE/MINUS - tr hai quan h t-ng thch
EXISTS - cho gi tr True nu biu thc sau n cha
t nht mt b, ng-c li cho gi tr False.

Cc hm trn ct

COUNT - cho s l-ng phn t ca ct
SUM - cho tng cc tr trong ct
MIN - cho gi tr nh nht trong ct
MAX - cho gi tr ln nht trong ct
AVG - cho gi tr trung bnh cng ca ct

B danh l cc nh danh t thm cho mt quan h
tin dng

Bi tp

Cc bi tp lin quan n CSDL Thc tp gm ba quan
h nh- m t trong ch-ng v i s quan h.

SV(SV#, HT, NS, QUE,HL)
DT(DT#,TDT,CN,KP)
Nguyn Xun
_________________________________________________________________
___

30
SD(SV#,DT#,NTT,KM, KQ)

Vi mi cu hi, yu cu tr li bng mt biu thc
SQL.

3.1. Danh sch cc sinh vin tr (d-i 18 tui) v
hc kh/gii (HL > 8.5)

3.2. Thng tin v cc ti -c cp kinh ph trn
10 triu ng

3.3. Danh sch cc sinh vin tr (d-i 18 tui),
hc v thc tp u t loi kh/gii (HL > 8.5 v
KQ > 8.5)

3.4. Danh sch cc ch nhim ti c cc sinh
vin qu H Ni tham gia.

3.5. Danh sch cc sinh vin hc gii hn cc sinh
vin H Ni.

3.6. im trung bnh ca cc sinh vin H Ni.

3.7. Tng s on -ng thc tp theo ti 5.

3.8. Tng s sinh vin i thc tp.

3.9. S tnh c sinh vin n thc tp theo ti
5.

3.10. Danh sch cc tnh v s sinh vin qu tnh
, nhm theo QUE.

3.11. Cc ti c trn 10 sinh vin ng k tham
gia:

*3.12. Dng SQL biu th cc php ton ca i
s quan h:
Nguyn Xun
_________________________________________________________________
___

31
a) R(e)
b) R[X]
c) R-S
d) R+S
e) R&S
f) R-S

nm 1973 v qu Hi Phng?

tp?

3.15. Cho bit cc a im thc tp xa tr-ng (KM
> 100) ca ti s 7?

ca cc sinh vin?

*3.17. Cho danh sch sinh vin thc tp ti qu
nh?

tp?

no tham gia?

triu v nhng ti c kinh ph trn 2 triu?

thc tp kh (c im kt qu trn 6)?

*3.22. Cho danh sch cc ti c sinh vin hc
gii nht lp tham gia.
Nguyn Xun
_________________________________________________________________
___

32

*3.23. Cho danh sch cc ti khng c sinh vin
hc km nht lp tham gia.

ph cp cho cc ti.

4.

*3.26. Cho quan h R(U). Hy dng SQL sinh ra
quan h rng S(U).

Nguyn Xun
_________________________________________________________________
___

33

Ch-ng 4

ph thuc hm

tm tt l thuyt

Cho tp thuc tnh U. Mt ph thuc hm (PTH) trn
U l cng thc dng
f: X Y; X, Y _ U

Nu f: X Y l mt ph thuc hm trn U th ta
ni tp thuc tnh Y ph thuc vo tp thuc tnh
X, hoc tp thuc tnh X xc nh hm tp thuc
tnh Y.

Cho quan h R(U) v mt PTH f: X Y trn U. Ta
ni quan h R tho PTH f v vit R(f), nu hai b
tu trong R ging nhau trn X th chng cng
ging nhau trn Y,

R(XY) (u,veR): (u.X=v.X) (u.Y=v.Y)

Nu Y khng ph thuc hm vo X th ta vit X !
Y.

Cho tp PTH F trn tp thuc tnh U. Ta ni quan h
R(U) tho tp PTH F, v vit R(F), nu R tho mi
PTH trong F,

R(F) ( f e F): R(f)

Nguyn Xun
_________________________________________________________________
___

34
Cho tr-c tp thuc tnh U, k hiu SAT(F) l tp
ton th cc quan h trn U tho tp PTH F.

Cho tp 9 cc quan h trn U, k hiu FD(9) l tp
cc PTH trn U tho trong mi quan h ca 9.

Cho tp PTH F trn tp thuc tnh U. Bao ng ca
F, k hiu F
+
l tp nh nht cc PTH trn U cha F
v tho cc tnh cht F1-F3 ca h tin
Armstrong A
o
sau y: X, Y, Z _ U:
F1. Tnh phn x: Nu X _ Y th X Y e F
+

F2. Tnh gia tng: Nu XY e F
+
th XZYZ e
F
+

F3. Tnh bc cu: Nu X Y e F
+
v Y Z e
F
+
th X Z e F
+

Ch

Cc PTH c v tri cha v phi nh- m t trong
(F1) -c gi l tm th-ng. Cc PTH tm th-ng
tho trong mi quan h.

Suy dn theo tin

Ta ni PTH f -c suy dn theo tin (hoc suy
dn logic) t tp PTH F v k hiu l F f, nu
f e F
+
.

F f f e F
+

Ni cch khc f -c suy dn theo tin t tp
PTH f nu xut pht t F, p dng cc lut F1, F2
v F3 ca h tin Armstrong sau hu hn ln ta
s thu -c PTH f.

Nguyn Xun
_________________________________________________________________
___

35
Ta vit F ! f biu th tp PTH F khng dn
theo logic ra -c PTH f.

Bao ng ca tp thuc tnh

Cho tp PTH F trn tp thuc tnh U v mt tp con
cc thuc tnh X trong U. Bao ng ca tp thuc
tnh X, k hiu X
+
l tp thuc tnh

X
+
= { A

e U | X A e F
+
}

Thut ton tm bao ng ca mt tp thuc tnh

cc thuc tnh X trong U. xc nh bao ng ca
tp thuc tnh X, X
+
ta xut pht t tp X v b
sung dn cho X cc thuc tnh thuc v phi R ca
cc PTH L R e F tha iu kin L _ X. Thut
ton s dng khi khng th b sung thm thuc tnh
no cho X.

Suy dn theo quan h

Cho tp PTH F trn tp thuc tnh U v f l mt
PTH trn U . Ta ni PTH f -c suy dn theo quan h
t tp PTH F v vit F f, nu mi quan h R(U)
tho F th R cng tho f.

F f SAT(F) _ SAT(f)

Cho tp thuc tnh U v tp PTH F trn U, ta nh
ngha F * l tp ton b cc PTH f -c suy dn
theo quan h t tp PTH F
F*= { f: X Y | X, Y _ U, F f }

Ta vit F ! f biu th tp PTH F khng dn
theo quan h ra -c PTH f .
Nguyn Xun
_________________________________________________________________
___

36

nh l (Tnh v cht ca h tin Armstrong)

F
+
= F *

Ni cch khc, suy dn theo quan h v suy dn theo
tin l mt, tc l
F f F f

Quy -c gin l-c

Ta th-ng vit X Y thay v vit X Y e F
+

hoc F X Y.

Bi ton thnh vin

Cho tp thuc tnh U, mt tp cc PTH F trn U v
mt PTH X Y trn U. Hi rng X Y e F
+
hay
khng ?

nh l
X Y e F
+
khi v ch khi Y _ X
+
.

L-c quan h

L-c quan h (LQH) l mt cp p = (U,F), trong
U l tp hu hn cc thuc tnh, F l tp cc
ph thuc hm trn U.

Quy -c

Trong tr-ng hp khng ch r tp PTH F, ta xem
LQH ch l mt tp hu hn cc thuc tnh U.

Nguyn Xun
_________________________________________________________________
___

37
bi tp

4.1. Cho quan h R(A,B,C,D) nh- sau

Cho bit cc ph thuc hm no lit k d-i y
-c tho trong quan h R?
f
1
: A A
f
2
: A B
f
3
: A C
f
4
: AC C
f
5
: A D
f
6
: D A

4.2. Vit thut ton tm bao ng ca mt tp thuc
tnh.

4.3. Chng minh tnh ng n ca h tin
Armstrong A
o
, tc l chng minh
F
+
_ F *
theo s sau:

Cho tp thuc tnh U, cc tp con thuc tnh X,Y,Z
_ U. Chng minh vi mi quan h R e REL(U), ta c

F1. Nu Y _ X th R(X Y) (tnh phn x)
F2. Nu R(X Y) th R(XZ YZ) (tnh gia
tng)
R(A B C D)
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
Nguyn Xun
_________________________________________________________________
___

38
F3. Nu R(X Y) v R(Y Z) th R(X Z)
(tnh bc cu)

4.4. Chng minh tnh ca h tin Armstrong
A
o
, tc l chng minh
F * _ F
+

theo s phn chng sau y:

Chng minh rng nu f: X Y e F
+
th f e F*
bng cch ch ra mt quan h R(U) tho cc PTH
trong tp F (thm ch trong F
+
) nh-ng khng tho
PTH f.

Ch : Quan h R xy dng nh- trn -c gi l quan
h Armstrong.

4.5. Cho tp thuc tnh U v cc tp ph thuc hm
F, G trn U. Chng minh
a. Nu F _ G th SAT(F) _ SAT(G)
b. SAT(FG) = SAT(F) SAT(G)

4.6. Cho tp thuc tnh U v cc quan h R v S
trn U. Chng minh
a. FD(R+S) _ FD(R ) FD(S)
b. R _ S FD(R) _ FD(S )
Tm th d chng t FD(R+S) c FD(R ) FD(S)

4.7. Cho tp thuc tnh U, tp ph thuc hm F
trn U v tp cc quan h 9 trn U. Chng minh
a. F _ FD(SAT(F))
b. 9 _ SAT(FD(9))
Nguyn Xun
_________________________________________________________________
___

39
c. SAT(FD(SAT(F))) = SAT(F)
d. FD(SAT(FD(9))) = FD(9)

4.8. S dng ba tin Armstrong chng minh
cc tnh cht F4-F11 sau y:

Vi mi tp con X, Y, Z, V ca U v vi mi thuc
tnh A trong U:

F4. Tnh ta bc cu: Nu XY, YZV th
XZV
F5. Tnh phn x cht: X X
F6. M rng v tri v thu hp v phi:
Nu XY th XZ Y \ V
F7. Cng tnh y :
Nu XY v ZV th XZYV
F8. M rng v tri:
Nu XY th XZY
F9. Cng tnh v phi:
Nu XY v XZ th XYZ
F10. B phn v phi:
Nu XYZ th XY
F11.Tnh tch lu:
Nu XYZ, ZAV th XYZA

4.9. Cho nh x ng f: Poset(U) Poset(U) trn
tp hu hn U. Ngoi ba tnh cht (C1)-(C3) -c s
dng lm tin cho cc nh x ng, chng minh
cc tnh cht sau y ca nh x ng (xem bi
1.35):
Nguyn Xun
_________________________________________________________________
___

40
X, Y e Poset(U)
(C4) f(XY) _ f(X)f(Y)
(C5) f(XY) _ f(X) f(Y)
(C6) f(f(X)Y) = f(Xf(Y)) = f(XY)

Chng minh php ton ly bao ng ca tp thuc
tnh l mt nh x ng tha cc tnh cht sau:

1. Tnh phn x: X
+
_ X
2. Tnh n iu: nu X _ Y th X
+
_ Y
+

3. Tnh lu ng: X
++
= X
+

4. (XY)
+
_ X
+
Y
+

5. ( X
+
Y)
+
= (XY
+
)
+
= ( XY)
+

6. XY khi v ch khi Y _ X
+

7. XY khi v ch khi Y
+
_ X
+

8. XX
+
v X
+
X
9. X
+
= Y
+
khi v ch khi XY v YX

Tng kt cc tnh cht ca PTH

Cc bi tp 4.10-4.13 d-i y lin quan n cc
tnh cht F1-F11 ca cc PTH.

Cho tp thuc tnh U. Vi mi tp con cc
thuc tnh X, Y, Z v V trong U v vi mi
thuc tnh A trong U ta c:
F1. Tnh phn x: Nu Y _ X th X Y
F2. Tnh gia tng: Nu X Y th XZ YZ
F3. Tnh bc cu: Nu X Y v Y Z th X Z
F4. Tnh ta bc cu: Nu XY, YZV th XZV
F5. Tnh phn x cht: X X
Nguyn Xun
_________________________________________________________________
___

41
F6. M rng v tri v thu hp v phi: Nu XY
th XZ Y \ V
F7. Cng tnh y : Nu XY v ZV th XZYV
F8. M rng v tri: Nu XY th XZY
F9. Cng tnh v phi: Nu XY v XZ th
XYZ
F10. B phn v phi: Nu XYZ th XY
F11.Tnh tch lu: Nu XYZ, ZAV th XYZA

4.10. Chng minh rng h tin B
o
sau y t-ng
-ng vi h tin Armstrong A
o

B
o
= {F5, F10, F11}

4.11. Chng minh rng h tin S
o
sau y t-ng
o

S
o
= {F1, F4}

4.12. Chng minh rng h tin D
o
sau y t-ng
o

D
o
= {F3, F5, F6, F7}

4.13. Chng minh rng h tin M
o
sau y t-ng
o

M
o
= {F4, F5, F8}

4.14. Cho LQH p = (U,F) vi U = ABCDE, F = { A
C, BC D, D E, E A }. Tnh
a) (AB)
+

b) (BD)
+
- D
+

4.15. Cho LQH p = (U,F) vi U = ABCDEG, F = { B
C, AC D, D G, AG E }. Cho bit
a) AB G e F
+
?
Nguyn Xun
_________________________________________________________________
___

42
b) BD AD e F
+
?

tm tt l thuyt

Ph

Cho hai tp PTH F v G trn cng mt tp thuc tnh
U. Ta ni F suy dn ra -c G, k hiu F G, nu
( g e G): (F g).

Ta ni F t-ng -ng vi G, k hiu F G, nu F
G v G F.

Nu F G ta ni G l mt ph ca F.

K hiu

- F ! G: F khng suy dn ra c G.
- F ! G: F v G khng tng ng.

Cho tp PTH F trn tp thuc tnh U v X l tp con
ca U, ta dng k hiu X
F
+
trong tr-ng hp cn ch
r bao ng ca tp thuc tnh X ly theo tp PTH
F.

Ph thu gn t nhin

Cho hai tp PTH F v G trn cng mt tp thuc tnh
U. G l ph thu gn t nhin ca F nu
1) G l mt ph ca F, v
2) G c dng thu gn t nhin theo ngha sau:
a) Hai v tri v phi ca mi PTH trong G
ri nhau (khng giao nhau)
Nguyn Xun
_________________________________________________________________
___

43
b) Cc v tri ca mi PTH trong G khc nhau
i mt.

4.16 Chng minh rng nu F v G l hai tp PTH trn
cng mt tp thuc tnh U th F G khi v ch khi
( X _ U): (X
F
+
= X
G
+
).

4.17 Cho tp PTH F trn tp thuc tnh U. Chng
minh F F
+
.

4.18 Cho cc tp con X, Y, Z, V v mt thuc tnh A
ca tp thuc tnh U. Xc nh mt trong cc quan
h cao nht cc cp tp PTH sau y bng cch t
du hoc du vo ch du ? Gii thch v sao.
a) { X Y, Z V } ? { XZ YV }
b) { X Y } ? { X Y-X }
c) { X Y } ? { XZ Y }
d) { X Y , Y Z } ? { X Z }
e) { X Y, YZ V } ? { XZ V }
f) { X Y } ? { XZ Y - V }
g) { X Y, X Z } ? { X YZ }
h) { X YZ } ? { X Y }
i) { X YZ, Z AV } ? { X YZA }

4.19 Xy dng thut ton tm ph thu gn t nhin
ca tp PTH F.

Ph khng d-

Cho hai tp PTH F v G trn tp thuc tnh U. G
-c gi l ph khng d- ca F nu
Nguyn Xun
_________________________________________________________________
___

44
2) G c dng khng d- theo ngha sau:
( g e G): G - { g } ! G

4.20 Xy dng thut ton tm ph khng d- ca tp
PTH F.

Ph thu gn

a) Cho hai tp PTH F v G trn tp thuc tnh U.
G -c gi l ph thu gn tri ca F nu
2) (XYeG,AeX): G - {XY} {(X-{A})Y} !
G

b) G -c gi l ph thu gn phi ca F nu
2) (XY e G, AeY):G-{XY}{X(Y-{A})} ! G

c) G -c gi l ph thu gn ca F nu G ng thi
l ph thu gn tri v thu gn phi ca F.
Nguyn Xun
_________________________________________________________________
___

45

4.21. Xy dng thut ton tm ph thu gn tri ca
tp PTH F.

4.22. Xy dng thut ton tm ph thu gn phi ca
tp PTH F.

4.23. Xy dng thut ton tm ph thu gn ca tp
PTH F.

4.24. Xy dng th d chng t vi tp PTH F sau
khi thc hin s d-i y th F vn ch-a phi l
ph thu gn phi:
a) Thu gn phi F
b) Thu gn tri F.

Ph ti tiu (Ullman J.)

Cho hai tp PTH F v G trn tp thuc tnh U. G
-c gi l ph ti tiu ca F nu
1) G l mt ph thu gn ca F,
2) V phi ca mi PTH trong G ch cha mt
thuc tnh,

4.25. Xy dng thut ton tm ph ti tiu ca tp
PTH F.

Ph thuc y

Tp thuc tnh Y _ U -c gi l ph thuc y
vo tp thuc tnh X _ U , v -c k hiu l
X + Y nu
1) X Y, v
2) ( A e X): X-{A} ! Y
Nguyn Xun
_________________________________________________________________
___

46

4.26. Chng minh rng vi mi tp PTH F trn U lun
tn ti mt ph G ca F sao cho mi PTH trong G u
l ph thuc y .

4.27. Xy dng thut ton tm mt ph y ca
tp PTH F.

Ph thuc bc cu

Tp thuc tnh Y _ U -c gi l ph thuc bc
cu vo tp thuc tnh X _ U , v -c k hiu l
X % Y nu

(- Z _ U): Y-Z = C, X Z, Z ! X, Z Y.

Nu X Y v Y khng ph thuc bc cu vo X th
ta ni Y ph thuc trc tip vo X v k hiu l
X * Y.

Ph thuc mnh, yu v i ngu

Cho tp thuc tnh U v hai tp con cc thuc
tnh X,Y _ U.

Quan h R(U) tha ph thuc mnh X (s) Y nu
vi hai b ty u v v trong R ging nhau ti mt
thuc tnh A trong X th hai b ging nhau trn
Y.

u, v e R: (- A e X: u.A = v.A u.Y = v.Y)

Quan h R(U) tha ph thuc yu X (w) Y nu
vi hai b ty u v v trong R ging nhau trn X
Nguyn Xun
_________________________________________________________________
___

47
th hai b ging nhau ti mt thuc tnh no
ca Y.

u, v e R: (u.X = v.X) (- B e Y: u.B = v.B)

Quan h R(U) tha ph thuc i ngu X (d) Y
nu vi hai b ty u v v trong R ging nhau ti
mt thuc tnh A no ca X th hai b ging
nhau ti mt thuc tnh no trn Y.

u, v e R: (- A e X: u.A = v.A) (- B e Y:
u.B = v.B)

4.28. Cho quan h R trn U v cc tp con thuc
tnh X, Y ca U. Chng minh:
a) R(X (s) Y) R(X Y)
b) R(X Y) R(X (w)Y)
c) R(X (d) Y) R(X (w)Y)
d) R(X (s) Y) R(X (d) Y)

4.29. Vi mi tp con thuc tnh X, Y, Z v thuc
tnh A trn tp thuc tnh U. in cc k hiu f,
s, w hoc d thay cho du ? khng nh cc tnh
cht cao nht ca cc ph thuc: hm, mnh, yu
hoc i ngu sau y:
1. Tnh phn x: Nu X _ Y th X (?) Y
2. Tnh gia tng: Nu X (?) Y th XZ (?) YZ
3. Tnh bc cu: Nu X (?) Y v Y (?) Z th X
(?) Z
4. Tnh ta bc cu: Nu X (?)Y, YZ (?)V th
XZ(?)V
5. Tnh phn x cht: X (?) X
Nguyn Xun
_________________________________________________________________
___

48
6. M rng v tri v thu hp v phi: Nu X
(?)Y th XZ (?) Y \ V
7. Cng tnh y : Nu X (?)Y v Z (?)V th
XZ (?)YV
8. M rng v tri: Nu X (?)Y th XZ (?)Y
9. Cng tnh v phi: Nu X (?)Y v X (?)Z
th X (?)YZ
10. B phn v phi: Nu X (?)YZ th X
(?)Y.
11.Tnh tch lu: Nu X (?)YZ, Z (?)AV th X
(?)YZA

Kha ca l-c quan h

Cho LQH p = (U,F). Tp thuc tnh K _ U -c gi
l kho ca L p nu
(i) K
+
= U
(ii) A e K: (K - {A})
+
= U

Hai iu kin trn t-ng -ng vi
(i') K U
(ii') A e K: (K - {A}) ! U

Thuc tnh A e U -c gi l thuc tnh kho
(nguyn thu hoc c s) nu A c trong mt kho
no y. A -c gi l thuc tnh khng kho (phi
nguyn thu hoc th cp) nu A khng c trong bt
k kho no.

Nu K tho iu kin (i) th K -c gi l mt siu
kho.
Nguyn Xun
_________________________________________________________________
___

49

Ch : Trong mt s t liu thut ng kho -c
dng theo ngha siu kho v thut ng kho ti
tiu -c dng theo ngha kho.

bi tp

4.30. Xy dng thut ton tm mt kha ca LQH.

4.31. Cho LQH p. Bit p c mt kha K. Hy xy
dng thut ton tm mt kha th hai M ca p. Nu p
khng c kha th hai thut ton cho kt qu l mt
tp rng.

4.32. Xy dng mt LQH c 5 thuc tnh ABCDE, mi
thuc tnh l mt kha.

4.33. LQH c 5 thuc tnh c th c ti a bao
nhiu kha. Cho th d.

4.34. Xy dng mt LQH c 5 thuc tnh ABCDE v
ch c mt kha duy nht.

4.35. (Nguyn Xun Huy) Cho K l mt kha ca LQH
p = (U,F). Chng minh rng vi mi tp con X ca K
ta c: X
+
K = X.

4.36. (L Vn Bo, Nguyn Xun Huy, H Thun) Cho
LQH p = (U,F). Gi M l giao ca cc kha ca p.
Chng minh rng
( )
L R F
M U R L
e
=
Nguyn Xun
_________________________________________________________________
___

50

4.37. (L Vn Bo, H Thun)Cho LQH p = (U,F).
Gi M l giao ca cc kha ca p. Chng minh rng p
c mt kha duy nht khi v ch khi M
+
= U.

4.38. Cho tp thuc tnh U vi n phn t. Chng
minh rng c th xy dng tp PTH F sao cho LQH p
= (U,F) c

C
n
n
2
kha,
trong ton t x cho ta cn nguyn d-i ca s
nguyn x,
m
n C
l t hp chp m ca n phn t.

4.39. Tm tp thuc tnh nguyn thu ca LQH sau:
p = (U,F), U = ABCDE,
F = { AB C, AD B, B D }.

4.40. Khng nh hoc bc b tnh ng ca cc mnh
sau:
a) K _ U l mt kho khi v ch khi K + U
(ph thuc y )
b) Hai kho khc nhau ca mt LQH khng giao
nhau.
c) Hai kho khc nhau ca mt LQH khng bao
nhau.
d) Mi LQH u c t nht mt kho.
e) Tn ti mt LQH khng c kho no.
f) S kho ca mt LQH khng th ln hn s
thuc tnh.
g) U khng th l kho ca LQH (U,F).
h) Mi LQH khng th c hai kho n tc l
kho ch gm mt thuc tnh.
Nguyn Xun
_________________________________________________________________
___

51

Ch-ng 5
Chun ha

Tm tt l thuyt

Php tch

Cho l-c quan h p = (U,F). Mt php tch trn
tp thuc tnh U l mt h cc tp con ca U =
(X
1
, X
2
,...,X
k
) tha tnh cht
U
k
i
i X
1 =
.

Php tch = (X
1
, X
2
,...,X
k
) trn tp thuc tnh U
-c gi l khng tn tht (hoc khng mt thng
tin) i vi tp PTH F nu

R(U) e SAT(F): R[X
1
] - R[X
2
] - ... - R[X
k
] = R

Ng-c li, nu khng tn ti ng thc th ta gi
l php tch tn tht.

Kim tra tnh tn tht ca php tch bng k thut
bng

Input
- LQH p = (U,F)
- Php tch = (X
1
, X
2
,...,X
k
)

Output
- True, nu l mt php tch khng tn tht
- False, ngoi ra.

Method
Nguyn Xun
_________________________________________________________________
___

52

1. Khi tr: Lp bng T vi cc ct l cc thuc
tnh trong U v k dng, mi dng ng vi mt thnh
phn ca X
i
trong : Dng i cha cc k hiu phn
bit (KHPB) a
j
ng vi cc thuc tnh A
j
trong X
i
v cc k hiu khng phn bit (KHKPB) b
ij
ng vi
cc thuc tnh A
j
trong U-X
i
. Ch rng mi KHPB
trong ct j ca T l ging nhau v bng a
j
cn mi
KHKPB trong T l khc nhau.

2. Sa bng: Lp n khi bng T khng cn thay i:
2.1. Vn dng cc F-lut bin i bng nh-
sau:
Vi mi PTH L R trong F, nu trong bng T
c cha hai dng u v v ging nhau trn L th sa
cc k hiu ca chng cho ging nhau trn mi thuc
tnh A trong R nh- sau:
a) nu u.A = v.A: khng sa,
b) nu ch mt trong hai i l-ng u.A
hoc v.A l KHPB th sa mi xut hin trong bng
ca KHKPB thnh KHPB ,
c) nu c hai i l-ng u.A v v.A u l
KHKPB th sa mi xut hin trong bng ca k hiu
c ch s th nht ln hn thnh k hiu th hai.

3. Kt lun:

Nu trong bng cha mt dng ton KHPB th return
True
nu khng return False.

end.

bi tp

Nguyn Xun
_________________________________________________________________
___

53
5.1. Chng minh rng nu X Y v X Y = C th
php tch (XY,
U-Y) l khng tn tht.

5.2. Dng k thut bng kim tra tnh tn tht
ca cc php tch sau:
a) p = (U,F), U = ABCD,
F = { A B, AC D }
= (AB, ACD).

b) p = (U,F), U = ABCDE,
F = { A C, B C, C D, DE C, CE
A }
= (AD, AB, BE, CDE).

Cc dng chun

LQH p = (U,F) -c gi l

a) dng chun 1 (1NF) nu mi thuc tnh
trong U u khng phi l thuc tnh phc hp,

b) dng chun 2 (2NF) nu p 1NF v mi
thuc tnh khng kho u ph thuc y vo
mi kho,

c) dng chun 3 (3NF) nu p 1NF v mi
thuc tnh khng kho u ph thuc trc tip
vo mi kho,

d) dng chun 3 mnh hoc Boyce-Codd (3SNF,
BCNF) nu p 1NF v mi thuc tnh u ph
thuc trc tip vo mi kho,

e) dng chun 3 mnh hoc Boyce-Codd (3SNF,
BCNF) nu p 1NF v mi PTH khng tm th-ng
XY u cho ta X l mt siu kha.
Nguyn Xun
_________________________________________________________________
___

54

Thut ton chun ho 3NF khng tn tht v bo ton
PTH

Algorithm 3NF
Input: LQH p = (U,F)
Output: Cc LQH 3NF
(U
1
,K
1
),(U
2
,K
2
), ...,(U
s
,K
s
) tho
a) R e REL(U): R[U
1
]-R[U
2
]-...-R[U
s
] = R
b) K
1
, K
2
, ..., K
s
l cc kho ca cc l-c t-ng
ng

Method
1. Tm mt kho K ca p
2. Tm mt ph ti tiu
G = {K
1
A
1
,K
2
A
2
,..., K
m
A
m
}
ca F.
3. Ghp cc PTH c cng v tri trong G thu -c
ph
G = {K
1
X
1
,K
2
X
2
,...,K
s
X
s
}
4. Xt php tch = (K
1
X
1
,K
2
X
2
,...,K
s
X
s
). Nu kho K
khng c mt trong thnh phn no ca th thm
thnh phn K vo .
5. return (K
1
X
1
,K
1
),(K
2
X
2
,K
2
),...,(K
s
X
s
,K
s
)
End 3NF.

5.3. Mt l-c quan h dng chun 3 v c mt
kho duy nht c th dng chun Boyce-Codd khng?
V sao?

5.4. Xc nh v gii thch dng chun cao nht ca
LQH sau:
p = (U, F); U = ABCD, F = { A C, D B, C
ABD }

5.5. Chng minh rng mt LQH dng chun 3 th
ng thi dng chun 2.
Nguyn Xun
_________________________________________________________________
___

55

5.6. Chng minh rng mt LQH dng chun BC th
ng thi dng chun 3.

5.7. Chun ho 3NF CSDL Thc tp:

vi cc tp PTH sau:
F
SV
= {SV# HT, NS, QUE, HL}
F
DT
= {DT# TDT, CN, KP}
F
SD
= {SV#, DT# NTT, KQ ; NTT KM}

5.8. Chun ho 3NF LQH p = (U,F) sau:
U = MLTGSDP,
F = { M T, GP M, GT P, MS D, GS
P}
vi ng ngha sau:
M: Mn hc chuyn
L: Lp chuyn
T: Thy - gio vin ph trch chuyn
G: Gi hc chuyn
S: Sinh vin theo hc chuyn
D: S ng k ca sinh vin trong chuyn
P: Phng hc dnh cho chuyn

M T: Mi chuyn c mt thy ph trch
GP M: Ti mi thi im, mi phng hc -c
dnh cho khng qu mt mn
Nguyn Xun
_________________________________________________________________
___

56
GT P: Ti mi thi im, mi thy dy trong
khng qu mt phng hc
MS D: Mi sinh vin tham gia chuyn no
th -c cp mt m s ghi danh theo chuyn

GS P: Ti mi thi im, mi sinh vin c
mt trong khng qa mt phng hc

5.9. Chng minh s t-ng -ng ca hai nh ngha d
v e v BCNF.

Nguyn Xun
_________________________________________________________________
___

57

mt s thi
Nguyn Xun
_________________________________________________________________
___

58

thi tuyn cao hc i hc thi nguyn
nm 2002
Mn: C s cng ngh thng tin,
Thi gian 180 pht, khng tham kho ti liu

bi gm 6 cu, trong 2 cu 5 v 6 c ni dung
v c s d liu quan h

Cu 5. a) nh ngha quan h, ph thuc hm.
b) Pht biu h tin Armstrong v tnh ng ca
h tin ny.
c) nh ngha l-c quan h v kho ca l-c
quan h
d) Pht biu bi ton thnh vin i vi l-c
quan h v kt qu lin quan ti bi ton thnh
vin.
Cu 6. a) Trnh by thut ton tnh bao ng ca
mt tp thuc tnh trong mt l-c quan h
b) Trnh by thut ton tm mt kho ca l-c
quan h.
c) Cho l-c quan h s = (R,F) vi R = abcdefg, F
= { abc de, bcd g, abf eg, ce fg }
Tm mt kho ca l-c s.
____________________

Nguyn Xun
_________________________________________________________________
___

59

thi tuyn nghin cu sinh
vin cng ngh thng tin
nm 2002
s 1

Trong thi, tp cc thuc tnh -c vit d-i
dng xu k t, k hiu XY -c hiu l php hp 2
tp X v Y, XY = XY. Thut ng kho -c hiu l
kho ti tiu, LQH: l-c quan h, PTH: ph
thuc hm.

Cu 1. nh ngha LQH. nh ngha bao ng ca tp
thuc tnh trong LQH. Thut ton tm bao ng ca
tp thuc tnh trong LQH.
Cu 2. Cho LQH p = (U, F) vi tp thuc tnh U =
ABCDEGH v tp ph thuc hm F = { CD H, E B,
D G, BH E, CH DG, C A }.
a. Tm tp M l giao ca ton b cc kho ca p.
Cho bit p c ng 1 kho hay khng?
b. Tp ABD c phi l kho ca p khng? V sao?
c. Tp CH c phi l kho ca p khng? V sao?
d. Tnh Z = (X
+
Y)
+
(K
+
- Y) bit X = CD, Y =
CH, K l mt siu kho ca p.
Cu 3. Php phn tch mt LQH: nh ngha php
phn tch v php phn tch khng mt thng tin.
Thut ton bng kim tra mt php phn tch khng
mt thng tin. Cho LQH p nh- trong cu 2. Vn dng
thut ton kim tra php phn tch w d-i y c
mt thng tin hay khng?
w = [ABCDE,BCH,CDEGH]
Cu 4. nh ngha cc dng chun 2NF, 3NF v BCNF
ca LQH. S t-ng quan gia cc dng chun. Xc
nh dng chun cao nht ca LQH h sau y:
h = (U, F); U = ABCD, F = { D B, C A, B
ACD }
Nguyn Xun
_________________________________________________________________
___

60
Gii thch v sao?
________________

Nguyn Xun
_________________________________________________________________
___

61

nm 2002
s 2

tp X v Y, XY = XY. Thut ng kho -c hiu l
kho ti tiu, LQH: l-c quan h, PTH: ph
thuc hm.

Cu 1. nh ngha PTH v LQH. Pht biu bi ton
thnh vin trn LQH. u kin cn v lin quan
n bi ton thnh vin.
Cu 2. nh ngha kho ca LQH. Thut ton tm 1
kho ca LQH.
Cu 3. nh ngha thuc tnh kho (thuc tnh c
bn hay nguyn thu), thuc tnh khng kho (thuc
tnh th cp). Cho LQH
s = (U, F), trong U = ABCD, F = { AD BC, B
A, D C }.
a) Tm cc kho ca s.
b) Cho bit C c phi l thuc tnh kho hay
khng?
Cu 4. nh ngha cc dng chun 2NF, 3NF v BCNF
ca LQH. S t-ng quan gia cc dng chun. Xc
nh dng chun cao nht ca LQH h sau:
h = (U, F); U = ABCD, F = { CD B, A C, B
ACD }
Gii thch v sao?
ABCDEHG v tp ph thuc hm F = { DE G, H C,
E A, CG H, DG EA, D B}.
Nguyn Xun
_________________________________________________________________
___

62
b. Tm 1 kho ca p.
c. Tp BCE c phi l kho ca p khng? V sao?
d. Hy thm hoc bt 1 ph thuc hm cho F LQH
c ng 1 kho.
_______________________

Nguyn Xun
_________________________________________________________________
___

63

i hc bch khoa h ni
nm 2002
(Tuyn nghin cu sinh hc trong n-c v n-c
ngoi)
Thi gian lm bi 180 pht, k t khi pht xong
thi.
Th sinh khng -c tham kho ti liu

Bi 1. nh ngha: l-c quan h, kho ca l-c
quan h. Thut ton tm mt kho ca l-c
quan h.
Bi 2. Cho l-c quan h p = (U,F) vi tp thuc
tnh U = ABCDEH v tp ph thuc hm F = {BC E,
D A, C A, AE D, BE CH }
a) Tm mt kho K ca l-c p.
b) Ngoi kho K, l-c p cn kho no khc
khng? V sao?
c) Tp BCH c phi l kho ca p khng? V sao?
d) Tp BD c phi l kho ca p khng? V sao?
e) Tnh Z = (X
+
Y)
+
K
+
- (X

Y) vi X = AB, Y =
D, K l mt siu kho ca p.
f) Hy thm cho F mt ph thuc hm p c ng
mt kho. Gii thch cch lm.
Bi 3. Mt l-c quan h dng chun 3 v c mt
V sao?

______________________
Nguyn Xun
_________________________________________________________________
___

64
thi tuyn cao hc ngnh GIS nm 2003
i hc bch khoa tp h ch minh
Mn: C s d liu, s 1

tp X v Y, XY = XY. Cc t vit tt: LQH: l-c
quan h, PTH: ph thuc hm.

Cu 1.
Php ton tr hai quan h: nh ngha. Thut
ton.
Cu 2.
a) nh ngha LQH.
b) nh ngha bao ng ca tp thuc tnh trong
LQH.
c) Thut ton tm bao ng ca tp thuc tnh
trong LQH.
ABCDE v tp PTH F = { DE A, B C, E AD }.
a) Tm mt kho ca l-c p.
b) Tp BCE c phi l kho ca p khng? V sao?
c) Tp AD c phi l kho ca p khng? V sao?
d) L-c p cn kho no na khng? V sao?
e) Tnh Z = (X
+
Y)
+
(K
+
- Y) bit X = DE, Y =
AD, K l mt siu kho ca p.
f) C th thm vo F mt PTH thu -c l-c
c ng 2 kho khng. Gii thch cch lm?
______________________________
Nguyn Xun
_________________________________________________________________
___

65
Mn: C s d liu, s 2


Cu 1.
Php ton kt ni t nhin hai quan h: nh
ngha. Thut ton.
Cu 2.
a) nh ngha LQH.
b) nh ngha kho ca LQH.
c) Thut ton tm mt kho ca LQH.
ABCDE v tp PTH F = { EA B, C D, A BE }.
b) Tp CDA c phi l kho ca p khng? V sao?
c) Tp BE c phi l kho ca p khng? V sao?
e) Tnh Z = (X
+
Y)
+
K
+
bit X = AE, Y = BE, K l
mt kho ca p.
_________________________________

Nguyn Xun
_________________________________________________________________
___

66

Mn: C s d liu, s 3


Cu 1.
Php ton ly giao hai quan h: nh ngha.
Thut ton.
Cu 2.
a) nh ngha bao ng ca tp thuc tnh trong
LQH.
b) Thut ton tm bao ng ca tp thuc tnh
trong LQH.
ABCDE v tp PTH F = { AB C, D E, B CA }.
b) Tp DEB c phi l kho ca p khng? V sao?
c) Tp CA c phi l kho ca p khng? V sao?
e) Tnh Z = (X
+
Y)
+
K
+
bit X = AB, Y = CA, K l
mt siu kho ca p.

_______________________________

Nguyn Xun
_________________________________________________________________
___

67

2

Bi gii

Nguyn Xun
_________________________________________________________________
___

68
Bi gii Ch-ng 1

Quan h v i s quan h

C s d liu minh ha: CSDL Thc tp


SV - tn quan h sinh vin
SV# - m s sinh vin
HT - h v tn sinh vin
NS - nm sinh ca sinh vin
QUE - qu (tnh)
HL - hc lc th hin qua im trung bnh

DT - tn quan h ti
DT# - m s ti
TDT - tn ti
CN - h v tn ch nhim ti
KP - kinh ph cp cho ti (triu ng).

Nguyn Xun
_________________________________________________________________
___

69
SD - tn quan h sinh vin - ti
SV# - m s sinh vin
DT# - m s ti m sinh vin tham gia
NTT - ni thc tp trin khai ti (tnh)
KM - khong cch t ni thc tp n tr-ng
KQ - kt qu thc tp theo ti chn

Gi thit l mt sinh vin c th tham gia nhiu
ti, mi ti sinh vin thc tp ti mt i
im.

1.1.

a) R[AB]=(A B)
a 1
b 2
a 4
c 5
b) R(3-B+D>1) =
(A B C D)
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
c 5 y 7
c) R(B<4)+R(D>3) =
(A B C D)
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
c 5 y 7

d) R(B>=1&B<=5) =
(A B C D) = R
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
a 4 x 2
c 5 y 7
Nguyn Xun
_________________________________________________________________
___

70

1.2. SV(NS<1983 & QUE="Hai Phng")

1.3. SD[NTT]

1.4. SD(DT#=7 & KM > 100)[NTT]

1.5. SD(NTT="Nha Trang")

*1.6. ((SV[SV#,HT,QUE])-(SD[SV#,NTT]))(QUE=NTT)[HT]

1.7. DT-SD[DT#]

1.8. (DT[DT#])-(SD[DT#])

1.9. DT(KP=1.5 | KP>2)[DT#]

1.10. SV(2003-NS<20)[SV#]-(SD(KQ>7)[SV#])

*1.11. SD[DT#,NTT] : (SD(DT#=1)[NTT])

e) R*S[C]
=(A B C D) = R
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
a 4 x 2
c 5 y 7
g) R(B<4)& R(D>3)
=(A B C D)
= C
=
h) R:S =(A B)
= C

f) R(B<4)-R(D>3)
=(A B C D)
a 1 x 2
a 1 y 2
b 2 x 1
b 2 y 1
Nguyn Xun
_________________________________________________________________
___

71
*1.12. (DT[DT#,TDT]-(SD[DT#,NTT]:SD[NTT]))[TDT]

*1.13.
(SV-(SD-(DT(KP-5>Sum(DT,KP))[DT#]))[SV#])[HT]

*1.14. SV(HL>Avg(SD(DT#=4),KQ))[HT]

1.15. Suy trc tip t nh ngha

1.16. Th d chng t cc php ton tr v chia
khng c tnh giao hon.

1.17.
a) R(e & h) = R(h & e), v e&h = h&e.
b) R(e & h) = R(e) & R(h) _ R(e), v e & h
e.
c) R(e & h) = R(h) & R(e) _ R(h), v e & h
h.
d) R(e & h) = R(e)(h), v t e R: Sat(t, e&h)
Sat(t,e) & Sat(t,h).
e) R(e | h) = R(h | e), v t e R: Sat(t, e |
h) Sat(t,e) | Sat(t,h).
f) R(e | h) = R(e) + R(h), xem e.
g) R(! e) = R-R(e), v t e R: Sat(t, ! e) !
Sat(t,e)
h) R(True) = R, v t e R: Sat(t, True)
R =(A) S(A)
a a
b
R-S =(A)
b
S-R = C

R =(A B) S(B)
a 1 1
b 2
R:S =(A)
a
S:R = C

Nguyn Xun
_________________________________________________________________
___

72
i) R(False) = C, v t e R: ! Sat(t, False)

*1.19. t e R : S t e R[M] & t-S _ R - u e
R: u.M = t & t-S _ R t=u.M e R[M] & u e R[M]-S
- R t e R[M] & t e (R[M]-S R)[M] t e
R[M] - (R[M]-S - R)[M].

1.20.

Php ton K hiu Tnh ng
chn ( ) c
chiu [ ] c
kt ni t
nhin
-
c
cng + khng *
giao & khng *
tr - khng *
chia : khng

(*) Cc php ton quan h cng, giao, tr khng
ng vi hai quan h khng t-ng thch.

1.21. Suy trc tip t nh ngha.

1.22. a) Th d chng t php ton tr khng c
tnh kt hp:
Cho tp thuc tnh tu U = C. Chn 3 b khc nhau
tu trn U l t, u, v. Xy dng cc quan h R = {
t, u }; S = R; T = { u, v}. Ta c
R-(S-T) = R-(R-T) = { u} = (R-S)-T = (R-R)-T = C -
T = C.

a) Th d chng t php chia khng c tnh
kt hp:

Nguyn Xun
_________________________________________________________________
___

73
Xt cc quan h R(A,B), S(B,C) v T(C). Ta c
R:(S:T) cho ta quan h c thuc tnh A, trong khi
biu thc (R:S):T khng c ngha.

1.26.

Php ton K hiu N/Co
ngang
N/Co
dc
Chn ( ) = -
Chiu [ ] - -
Kt ni t
nhin
-
+ + -
Cng + = +
Giao & = -
Tr - = -
Chia : - -

*1.29. Chng hn, R(False) hoc R(A = A) vi A l
mt thuc tnh bt k trong U.

*1.33. Th d chng t R[X
1
] - R[X
2
] - ... - R
[X
k
] = R

R =(A B C) P = R[AB] Q = R[BC] P*Q = (A B C) = R
a 1 x = (A B) = (B C) a 1 x
b 1 y a 1 1 x a 1 y
b 1 1 y b 1 x
b 1 y

Nguyn Xun
_________________________________________________________________
___

74

*1.36. SV - DT cho ta tch Descartes.

Nguyn Xun
_________________________________________________________________
___

75

Bi gii Ch-ng 2

Cc thao tc trn b v quan h

2.1.
Algorithm Selection
Format: P = R(e)
Input: - Quan h R(U)
- Biu thc chn e trn U.
Output: - Quan h
P(U) = R(e) = {teR|Sat(t,e)}
Method
// To lp quan h P vi tp thuc tnh
// ca quan h R
Create(P,Attr(R));
for each tuple t in R
with Sat(t,e) do
add t to P ;
endfor;
return P;
end Selection;

2.2.
Algorithm Projection
Format: P = R[X]
- Tp con thuc tnh X ca U.
Output: - Quan h R[X]={t.X | teR}
Method
Create(P,X);
with t.X not_in P do
add t to P ;
Nguyn Xun
_________________________________________________________________
___

76
endif;
endfor;
return P;
end Projection;

2.3.
Algorithm Join
Format: P = R-S
- Quan h S(V)
Output: - Quan h
R-S={u-v|ueR,veS,u.M = v.M, M = U v}
Method
X = Attr(R) Attr(S);
M = Attr(R) Attr(S);
Create(P,X);
for each tuple u in R do
for each tuple v in S do
if u.M=v.M then
add u-v to P ;
endif;
endfor;
endfor;
return P;
end Join;

2.4.
Algorithm Union
Format: P = R+S
- Quan h S(U)
Output: - Quan h R+S={t|teR v teS}
Method
Create(P,Attr(R));
add u to P;
endfor;
Nguyn Xun
_________________________________________________________________
___

77
for each tuple v in S
with v not_in R do
add v to P ;
endfor;
return P;
end Union;

2.5.
Algorithm Intersection
Format: P = R&S
- Quan h S(U)
Output: - Quan h R&S={t|teR . teS}
Method
Create(P,Attr(R));
for each tuple u in R
with u in S do
add u to P;
endfor;
return P;
end Intersection;

2.6.
Algorithm Substraction
Format: P = R-S
- Quan h S(U)
Output: - Quan h R-S={t|teR . teS}
Method
Create(P,Attr(R));
with u not_in S do
add u to P;
endfor;
return P;
end Substraction;

2.7.
Nguyn Xun
_________________________________________________________________
___

78
Algorithm Division
Format: P = R:S
- Quan h S(V)
Output:
- Quan h R:S={t.M|teR,(t.M)-S _ R,M = U-V}
Method
M = Attr(R)- Attr(S);
c := Card(S);//s b ca S
Create(P,M);
with t.M not_in P do
d:=0;//khi to bin m
if (t.M)-v in R then
d:=d+1
else breakfor;
endif;
endfor;
if d=c then
add t.M to P;
endif;
endfor;
return P;
end Division;

2.8.
Algorithm Selection_Projection
Format: P = R(e,X)
- Biu thc chn e trn U.
- Tp con X ca U.
Output: - Quan h
P(X) = R(e,X) = {t.X | teR, Sat(t,e)}
Method
Create(P,X);
Nguyn Xun
_________________________________________________________________
___

79
with Sat(t,e) do
if t.X not_in P then
add t.X to P ;
endif;
endfor;
return P;
end Selection_Projection;

2.9.
Algorithm Join_Selection_Projection
Format: P = (R-S)(e,X)
- Quan h S(V)
- Biu thc chn e trn UV.
- Tp con X ca UV.
Output: - Quan h
P(X) = (R-S)(e,X) = {(u-v).X | ueR,veS, u.M = v.M,
Sat(u-v,e), M = U V }
Method
M := Attr(R) Attr(S);
Create(P,X);
with u.M = v.M do
if Sat(u-v,e) then
construct t=(u-v).X;
if t not_in P then
add t to P ;
endif;
endif;
endfor;
endfor;
return P;
end Join_Selection_Projection;

2.10.
Algorithm Card
Nguyn Xun
_________________________________________________________________
___

80
Format: c = Card(R)
Output: - s b ca quan h R.
Method
c:=0;
c:=c+1;
endfor;
return c;
end Card;

2.11.
Algorithm Sum
Format: s = Sum(R,A)
- Thuc tnh kiu s A trong U
Output: - Tng s cc tr trn ct A trong quan
h R
Method
s:=0;
s:=s+u.A;
endfor;
return s;
end Sum;

2.12.
Algorithm Avg
Format: s = Avg(R,A)
Output: - Tr trung bnh ca ct A trong quan
h R
Method
s:=0;c:=0;
s:=s+u.A;
c:=c+1;
Nguyn Xun
_________________________________________________________________
___

81
endfor;
if c > 0 then return s/c
else return null;
endif;
end Avg;

2.13.
Algorithm Max
Format: smax = Max(R,A)
- Thuc tnh kiu snh -c A trong U
Output: - Tr ln nht ca ct A trong quan h
R
Method
smax:= -;
if smax < u.A then
smax:=u.A;
endif;
endfor;
return smax;
end Max;

2.14.
Algorithm Min
Format: smin = Min(R,A)
- Thuc tnh kiu snh -c A trong U
Output: - Tr nh nht ca ct A trong quan h
R
Method
smin:= +;
if smin > u.A then
smin:=u.A;
endif;
endfor;
return smin;
Nguyn Xun
_________________________________________________________________
___

82
end Min;

2.15.
Algorithm Sum
Format: s = Sum(R,A,e)
- Biu thc e trn U
Output: - Tng s cc tr trn ct A ca cc b
tha iu kin e trong quan h R
Method
s:=0;
with sat(u,e) do
s:= s+u.A;
endfor;
return s;
end Sum;

Nguyn Xun
_________________________________________________________________
___

83
Bi gii Ch-ng 3

ngn ng hi sql

CSDL Thc tp
SV(SV#, HT, NS, QUE,HL)
DT(DT#,TDT,CN,KP)
SD(SV#,DT#,NTT,Km, KQ)

3.1. Danh sch cc sinh vin tr (d-i 18 tui) v
hc kh/gii (HL > 8.5):

SELECT HT
FROM SV
WHERE 2003-NS < 18 AND HL > 8.5;

3.2. Thng tin v cc ti -c cp kinh ph trn
10 triu ng:

SELECT *
FROM DT
WHERE KP > 10;

3.3. Danh sch cc sinh vin tr (d-i 18 tui),
hc v thc tp u t loi kh/gii (HL > 8.5 v
KQ > 8.5):

SELECT HT
FROM SV
WHERE 2003-NS < 18 AND HL > 8.5
AND SV# IN
(SELECT SV#
FROM SD
WHERE KQ > 8.5);
Nguyn Xun
_________________________________________________________________
___

84

3.4. Danh sch cc ch nhim ti c cc sinh
vin qu H Ni tham gia:

SELECT CN
FROM DT
WHERE DT# IN
(SELECT DT#
FROM SD
WHERE SV# IN
(SELECT SV#
FROM SV
WHERE QUE = 'Ha Noi'));

3.5. Danh sch cc sinh vin hc gii hn cc sinh
vin H Ni:

SELECT HT
FROM SV
WHERE HL > ALL
(SELECT HL
FROM SV
WHERE QUE = 'Ha Noi');

3.6. im trung bnh ca cc sinh vin H Ni:

SELECT AVG(HL)
FROM SV
WHERE QUE = 'Ha Noi';

3.7. Tng s on -ng thc tp theo ti 5:

SELECT SUM(KM)
FROM SD
WHERE DT# = 5;

3.8. Tng s sinh vin i thc tp:

SELECT COUNT(DISTINCT SV#)
FROM SD;
Nguyn Xun
_________________________________________________________________
___

85

3.9. S tnh c sinh vin n thc tp theo ti
5:

SELECT COUNT(DISTINCT NTT)
FROM SD
WHERE DT# = 5;

3.10. Danh sch cc tnh v s sinh vin qu tnh
, nhm theo QUE:

SELECT QUE, COUNT(*)
FROM SV
GROUP BY QUE;

3.11. Cc ti c trn 10 sinh vin ng k tham
gia:

SELECT TDT
FROM DT
WHERE 10 < (SELECT COUNT(*)
FROM SD
WHERE DT.DT# = SD.DT#);

*3.12. Dng SQL biu th cc php ton ca i
s quan h:

a) R(e):

SELECT *
FROM R
WHERE e;

b) R[X]:

SELECT DISTINCT X
FROM R;

c) R-S: Gi s Attr(R) Attr(S) =
{A
1
,A
2
,...,A
k
}

Nguyn Xun
_________________________________________________________________
___

86
SELECT *
FROM R, S
WHERE R.A
1
= S.A
1
AND R.A
2
= S.A
2

AND
AND R.A
k
= S.A
k
;

d) R+S:

R
UNION
S;

e) R&S:

R
INTERSECT
S;

f) R-S:

R
MINUS
S;

nm 1973 v qu Hi Phng:

SELECT *
FROM SV
WHERE NS < 1973 AND QUE = 'Hai Phong';

tp:

SELECT DISTINCT NTT
FROM SD;

3.15. Cho bit cc a im thc tp xa tr-ng (Km
> 100) ca ti s 7:

SELECT DISTINCT NTT
Nguyn Xun
_________________________________________________________________
___

87
FROM SD
WHERE DT# = 7
AND KM > 100;

ca cc sinh vin:

SELECT *
FROM SD
WHERE NTT = 'Nha Trang';

*3.17. Cho danh sch sinh vin thc tp ti qu
nh:

SELECT HT
FROM SV, SD
WHERE SV.SV# = SD.SV#
AND SV.QUE = SD.NTT;

tp:

SELECT DISTINCT *
FROM DT
WHERE EXISTS
(SELECT *
FROM SD
WHERE DT.DT# = SD.DT#);

no tham gia:

SELECT DT#
FROM DT
MINUS
SELECT DISTINCT DT#
FROM SD;

triu v nhng ti c kinh ph trn 2 triu:

SELECT DT#
Nguyn Xun
_________________________________________________________________
___

88
FROM DT
WHERE KP = 1.5
OR KP > 2;

thc tp kh (c im kt qu trn 6):

SELECT SV#
FROM SV
WHERE 2003 - NS < 24
AND SV# IN
(SELECT SV#
FROM SD
WHERE KQ > 6);

*3.22. Cho danh sch cc ti c sinh vin hc
gii nht lp tham gia:

SELECT TDT
FROM DT
WHERE DT# IN
( SELECT DISTINCT DT#
FROM SD
WHERE SV# IN
( SELECT SV#
FROM SV
WHERE HL = ( SELECT MAX(HL)
FROM SV )));

*3.23. Cho danh sch cc ti khng c sinh vin
hc km nht lp tham gia:

SELECT TDT
FROM DT
WHERE DT# IN
(( SELECT DT#
FROM DT )
MINUS
FROM SD
WHERE SV# IN
( SELECT SV#
FROM SV
Nguyn Xun
_________________________________________________________________
___

89
WHERE HL = ( SELECT MIN(HL)
FROM SV ))));

Ch : biu thc SQL sau y

SELECT TDT
FROM DT
WHERE DT# IN
FROM SD
WHERE SV# IN
( SELECT SV#
FROM SV
WHERE HL > ( SELECT MIN(HL)
FROM SV )));

cho bit danh sch cc ti c sinh vin tham
gia, nh-ng nhng sinh vin ny khng phi l nhng
ng-i hc km nht lp.

ph cp cho cc tI:

SELECT HT
FROM SV
WHERE SV# IN
( SELECT SV#
FROM SD
WHERE DT# IN
( SELECT DT#
FROM DT
WHERE 5-KP > ( SELECT SUM(KP)
FROM DT )));

4:

SELECT HT
FROM SV
WHERE HL > ( SELECT AVG(KQ)
Nguyn Xun
_________________________________________________________________
___

90
FROM SD
WHERE DT# = 4);

*3.26. Cho quan h R(U). Hy dng SQL sinh ra
quan h rng S(U):

SELECT *
FROM R
WHERE False;
Nguyn Xun
_________________________________________________________________
___

91

Bi gii Ch-ng 4
ph thuc hm

4.1.
f
1
: A A : tha,
f
2
: A B: tha,
f
3
: A C: khng tha,
f
4
: AC C: tha,
f
5
: A D: tha,
f
6
: D A: tha.

4.2.
Algorithm Closure
Format: Y = X

+

Input: - LQH p =(U,F)
- Tp thuc tnh X _ U
Output: - Y = X

+
= { A e U | X A }
Method
Y:=X;
repeat
Z:=Y;
for each FD L R in F do
if L _ Y then
Y:=Y R;
endif;
Nguyn Xun
_________________________________________________________________
___

92
endfor;
until Y=Z;
return Y;
end Closure;

4.3.
F1. Nu Y _ X th R(X Y) (tnh phn x)
u,veR: u.X=v.X u.Y=v.Y , v Y _ X.

F2. Nu R(X Y) th R(XZ YZ) (tnh gia
tng)
u,veR: u.XZ=v.XZ u.X=v.X & u.Z=v.Z
u.Y=v.Y & u.Z=v.Z u.YZ=v.YZ

F3. Nu R(X Y) v R(Y Z) th R(X Z)
(tnh bc cu)
u,veR: u.X=v.X u.Y=v.Y u.Z=v.Z

4.4. Gi s f: X Y e F
+
. Ta chng minh X Y
e F* bng cch ch ra mt quan h Armstrong R(U)
tho cc PTH trong tp F (thm ch trong F
+
) nh-ng
khng tho PTH f .

Quan h Armstrong R -c xy dng nh- sau:

Gi s U = {A
1
, A
2
,..., A
n
} v a
i
v b
i
l hai phn
t khc nhau ca dom(A
i
), i = 1..n. Quan h R cha
2 b u v v nh- sau:
u = (a
1
, a
2
,..., a
n
).
v.A
i
=a
i
, nu A
i
e X
+
, nu khng ta t v.A
i
=b
i

, i = 1..n.

Tr-c ht ta chng minh R khng tho PTH XY. Theo
cch xy dng R, ta c hai b u v v ging nhau
trn min ln duy nht l X
+
, u.X
+
= v.X
+
v do X
+

_ X nn u.X = v.X. Gi s u.Y = v.Y . Th th
Nguyn Xun
_________________________________________________________________
___

93
Y_X
+
. Theo nh ngha bao ng ta suy ra XY e
F
+
, mu thun vi gi thit. Vy R khng tho PTH
XY.

Ta chng minh R tho mi PTH trong F
+
. Gi s WZ
e F
+
v u.W = v.W. T y rt ra, do c im ca
R, W _ X
+
. Theo nh ngha bao ng, X W e F
+
,
theo tnh cht bc cu cho cc PTH X W v WZ ta
suy ra XZ e F
+
. Li theo nh ngha bao ng ta
c Z _ X
+
v do , theo c im ca R ta c u.Z =
v.Z. Vy R tho WZ pcm.

Ch : Chng minh -c da trn gi thit l min
tr ca cc thuc tnh trong quan h cha t nht 2
tr phn bit. Gi thit ny l kh t nhin, v
nu trong bng c mt ct ch cha mt tr duy nht
th ta c th xo ct .

4.5. a. Nu F _ G th SAT(F) _ SAT(G): R(G)
R(F).
b. SAT(FG) = SAT(F) SAT(G): R(FG) R(F) .
R(G).

4.6. Ch : Nhng ch c du ? l gi bn c
gii thch v sao.

Chng minh mnh b tr-c sau suy ra mnh a.

b. R _ S FD(R) _ FD(S):

Gi s XY e FD(S ) v u v v l hai b trong R
tha u.X=v.X. Ta c u, v e S (?). Do u.Y=v.Y
(?), t suy ra XY e FD(R).

a. FD(R+S) _ FD(R) FD(S)
Nguyn Xun
_________________________________________________________________
___

94
V R+S _ R v R+S _ S nn, theo cu b ta
c
FD(R+S) _ FD(R ) v FD(R+S) _ FD(S). T
suy ra a.

Th d chng t FD(R+S) c FD(R ) FD(S).
U=AB; R cha mt b duy nht u = (1,x); S cha
mt b duy nht v = (1,y), x = y. R v S tha
mi PTH trn U(?). Quan h P=R+S cha 2 b u v
v. P khng tha PTH A B(?).

4.7.

Nhn xt : Cc ton t SAT v FD c tnh nghch
bin(?) v
F f
f SAT F SAT
e
= ) ( ) ( v
9 e
= 9
R
R FD FD ) ( ) (

4.8.

Vi mi tp con X, Y, Z, V ca U v vi mi thuc
tnh A trong U:
F4. Tnh ta bc cu: Nu XY, YZV th XZV

XY (gt)
YZV (gt)
XZYZ (F2)
XZV (F3)

F5. Tnh phn x cht: X X (F1)

F6. M rng v tri v thu hp v phi: Nu XY
th XZ Y \ V

Nguyn Xun
_________________________________________________________________
___

95
XY (gt)
YY \ V (F1)
XY \ V (F3)
XZX (F1)
XZY \ V (F3)

F7. Cng tnh y : Nu XY v ZV th XZYV

XY (gt)
ZV (gt)
XZYZ (F2)
YZYV (F2)
XZYV (F3)

F8. M rng v tri: Nu XY th XZY
XZX (F1)
XY (gt)
XZY (F3)

F9. Cng tnh v phi: Nu XY v XZ th XYZ

XY (gt)
XXY (F2)
XZ (gt)
XYYZ (F2)
XYZ (F3)

F10. B phn v phi: Nu XYZ th XY

XYZ (gt)
YZY (F1)
XY (F3)

F11.Tnh tch lu: Nu XYZ, ZAV th XYZA
Nguyn Xun
_________________________________________________________________
___

96

ZAV (gt)
YZZYZAV (F2)
YZYZAV
YZAVYZA (F1)
YZYZA (F3)
XYZ (gt)
XYZA (F3)

4.9.
X, Y e Poset(U)

(C4) f(XY) _ f(X)f(Y):
XY _ X (ltth- theo l thuyt tp hp)
f(XY) _ f(X) (C2)
XY _ Y (ltth)
f(XY) _ f(Y) (C2)
f(XY) _ f(X)f(Y) (Cng tnh ca ltth)

(C5) f(XY) _ f(X) f(Y):
X Y _ X (ltth)
f(XY) _ f(X) (C2)
X Y _ Y (ltth)
f(XY) _ f(Y) (C2)
f(XY) _ f(X) f(Y) (ltth)

(C6) f(f(X)Y) = f(XY):
X _ f(X) (C1)
XY _ f(X)Y (ltth)
f(XY) _ f(f(X)Y) (C2)
X _ XY (ltth)
f(X) _ f(XY) (C2)
Y _ XY (ltth)
XY _ f(XY) (C1)
Nguyn Xun
_________________________________________________________________
___

97
Y _ f(XY) (Tnh cht bc cu ca ltth)
f(X)Y _ f(XY) (Cng tnh ca ltth)
f(f(X)Y) _ f(f(XY))=f(XY) (C2,C3)
f(Xf(Y)) = f(XY): t-ng t

Chng minh php ton ly bao ng ca tp thuc
tnh l mt nh x ng tha cc tnh cht sau:
1. Tnh phn x X
+
_ X: (nb - Theo nh ngha
bao ng)
2. Tnh n iu nu X _ Y th X
+
_ Y
+
(ttb -
thut ton tm bao ng)
3. Tnh lu ng X
++
= X
+
: (ttb)
4. (XY)
+
_ X
+
Y
+
: (C4)
5. ( X
+
Y)
+
= (XY
+
)
+
= ( XY)
+
: (C6)
6. XY khi v ch khi Y _ X
+
: (nb)
7. XY khi v ch khi Y
+
_ X
+
: (nb, C2,C3)
8. XX
+
v X
+
X: (nb,C1)
9. X
+
= Y
+
khi v ch khi XY v YX: (nb)

4.10.

A
o
= {F1, F2, F3} B
o
= {F5, F10, F11}

[A
o
B
o
]: xem bi 4.8

[B
o
A
o
]

[B
o
F1]:

X _ Y (gt)
X=MY (gt)
MY MY (F5)
Nguyn Xun
_________________________________________________________________
___

98
X MY
X Y (F10), pcm.

Tr-c ht chng minh [B
o
F11'] vi

F11' (Tnh tch lu m rng): Nu XYZ v
ZMV th XYZM trong M l mt tp con ca
U.

Gi s M=A
1
A
2
...A
k
. Ta k hiu V
i
=(M\A
i
)V,
i=1..k. Ta c, vi mi i=1..k: MV=A
i
V
i
.

XYZ (gt)
ZA
1
V
1
(gt)
XYZA
1
(F11)
X(YA
1
)Z
ZA
2
V
2
(gt)
XYA
1
ZA
2
(F11)
X(YA
1
A
2
)Z
...
X(YA
1
A
2
...A
k
)Z (F11), hay
XYZM, pcm.

[B
o
F3]:

XCY (gt)
YCZ(gt)
XCYZ (F11')
XZ (F10), pcm.

[B
o
F2]:

XZXZ (F5)
XY (gt)
Nguyn Xun
_________________________________________________________________
___

99
XZXYZ (F11')
XYZYZ (F1 chng minh)
XZYZ (F3 chng minh), pcm.

4.11. A
o
= {F1, F2, F3} S
o
= {F1, F4}

[A
o
S
o
]: xem bi 4.8

[S
o
A
o
]:

[S
o
F2]:

XY (gt)
YZ YZ (F1)
XZ YZ (F4), pcm

[S
o
F3]:

XY (gt)
YC Z (gt)
XC Z (F4)
X Z , pcm.

4.12. A
o
= {F1, F2, F3} D
o
= {F3, F5, F6, F7}

[A
o
D
o
]: xem bi 4.8

[D
o
A
o
]:

[D
o
F1]:

X _ Y (gt)
X = MY (gt)
Y Y (F5)
Nguyn Xun
_________________________________________________________________
___

100
MY Y - C (F6)
X Y , pcm.

[D
o
F2]:

X Y (gt)
Z Z (F5)
XZ YZ (F7), pcm.

4.13. A
o
= {F1, F2, F3} M
o
= {F4, F5, F8}

[A
o
M
o
]: xem bi 4.8

[M
o
A
o
]:

[M
o
F1]:

X _ Y (gt)
X = MY (gt)
Y Y (F5)
MY Y (F8)
X Y ,pcm.

[M
o
F2]:

X Y (gt)
YZ YZ (F5)
XZ YZ (F4), pcm.

[M
o
F3]:

X Y (gt)
Y Z (gt)
YC Z (gt)
Nguyn Xun
_________________________________________________________________
___

101
XC Z (F4)
X Z, pcm.

4.14. p = (U,F), U = ABCDE, F = { A C, BC D,
D E, E A }.

a) (AB)
+
= ABCDE = U.

b) (BD)
+
- D
+
= ABCDE-ACDE= B.

4.15. p = (U,F), U = ABCDEG, F = { B C, AC D,
D G, AG E }.

a) AB G e F
+
v (AB)
+
= ABCDEG _ G

b) BD AD e F
+
v AD . (BD)
+
= BCDG.

4.16 F G ( X _ U): (X
F
+
= X
G
+
)?

X Y e F
+
Y _ X
F
+
= X
G
+
X Y e G
+
.

4.17 F F
+
?

F F
+
(theo nh ngha)
F
+
F (v F
+
_ F)

4.18

a) F={ XY, Z V } G={ XZ YV } , v
(XZ)
+
F
=XYZV _ YV.

b) F={ XY } G={ XY-X }, v X
+
F
=

X
G
+
= XY.

c) F={ XY } G={ XZY }, v (XZ)
+
F
= XYZ _
Y.
Nguyn Xun
_________________________________________________________________
___

102

d) F={ XY , Y Z } G= { XZ }, v X
+
F
= XYZ
_ Z.

e) F={ XY, YZV } G={ XZV }, v (XZ)
+
F
=
XYZV _ V.

f) F={ X Y } G={ XZY-V }, v (XZ)
+
F
= XYZ
_ Y _ Y-V.

g) F={X Y, X Z} G={XYZ}, v X
+
F
= X
+
G
=
XYZ _ Y,Z,YZ.

h) F={ X YZ } G={ XY }, v X
+
F
= XYZ _ Y.

i) F={ XYZ, ZAV } G={ XYZA }, v X
+
F
=
XYZAV_YZA.

4.19 Thut ton tm ph thu gn t nhin ca tp
PTH F.

Algorithm Natural_Reduced
Format: Natural_Reduced(F)
Input: - Tp PTH F
Output: - Mt ph thu gn t nhin G ca F
- G F
- LR e G: LG = C
- L
i
R
i
,L
j
R
j
eG: i=j L
i
=L
j

Method
G:=C;
Z:=R-L;
if Z = C then
if there is an FD LY in G then
replace LY in G by LYZ
Nguyn Xun
_________________________________________________________________
___

103
else add LZ to G;
endif;
endif;
endfor;
return G;
end Natural_Reduced;

4.20 Thut ton tm ph khng d- ca tp PTH F.

Algorithm Nonredundant
Format: Nonredundant(F)
Input: - Tp PTH F
Output: - Mt ph khng d- G ca F
- G F
- g eG: G-{g} ! G
Method
G:=F;
for each FD g:L R in F do
if R _ L
+
G-{g}
then
G:=G-{g};
endif;
endfor;
return G;
end Nonredundant;

4.21. Xy dng thut ton tm ph thu gn tri ca
tp PTH F.

rng ta lun c

g:LR eG,AeL: G-{g}{L-{A}R} LR,
v L-{A}_L, do ta ch cn kim tra
G (L-{A})R.

Algorithm Left_Reduced
Format: Left_Reduced(F)
Input: - Tp PTH F
Nguyn Xun
_________________________________________________________________
___

104
Output: - Mt ph thu gn tri G ca F
- G F
- g:LR eG,AeL: G-{g}{L-{A}R}!G
Method
G:=F;
X:=L;
for each attribute A in X do
if R _(L-{A})
+
G
then
delete A from L in G;
endif;
endfor;
endfor;
return G;
end Left_Reduced;

4.22. Xy dng thut ton tm ph thu gn phi ca
tp PTH F.

rng ta lun c

g:LR eG,AeR: G LR-{A},
v R-{A}_R, do ta ch cn kim tra
G-{LR}{LR-{A}} LR.

Algorithm Right_Reduced
Format: Right_Reduced(F)
Input: - Tp PTH F
Output: - Mt ph thu gn phi G ca F
- G F
- g:LR eG,AeR: G-{g}{LR-{A}}!G
Method
G:=F;
X:=R;
Nguyn Xun
_________________________________________________________________
___

105
for each attribute A in X do
if A in L
+
G-{LR}{LR-{A}}
then
delete A from R in G;
endif;
endfor;
endfor;
return G;
end Right_Reduced;

4.23. Xy dng thut ton tm ph thu gn ca tp
PTH F.

Algorithm Reduced
Format: Reduced(F)
Input: - Tp PTH F
Output: - Mt ph thu gn G ca F
Method
G:=Right_Reduced(Left_Reduced(F));
return G;
end Reduced;

4.24. Xy dng th d chng t vi tp PTH F sau
khi thc hin

G:=Left_Reduced(Right_Reduced(F));

G li c th tr thnh ph ch-a thu gn phi.

Xt tp PTH

F = {DABC,BCD,AD}
H:=Right_Reduced(F)={DAB,BCD,AD}
G:=Left_Reduced(H)={AB,BCD,AD}

G khng phI l tp PTH thu gn phI v ta cn c
th b thuc tnh D PTH th ba trong G,

Nguyn Xun
_________________________________________________________________
___

106
Right_Reduced(G)={AB,BCD,AC}{AB,BCD}

Ch rng cc PTH c v phI l tp rng th khng
cha thng tin do c th loi b chng khi tp
PTH. T suy ra rng nu tp PTH c cc v phI
l mt thuc tnh th vic tm thu gn phI t-ng
-ng vi vic tm ph khng d-.

4.25. Thut ton tm ph ti tiu ca tp PTH F.

Algorithm MinCover
Format: MinCover(F)
Input: - Tp PTH F
Output: - Mt ph ti tiu G ca F
Method
// Tch mi PTH LR trong F thnh
// cc PTH LA, A e R
G := C;
for each attribute A in R do
if LA not_in G then
add LA to G;
endif;
endfor;
endfor;
G:=Reduced(G);
return G;
end MinCover;

4.26. Chng minh rng vi mi tp PTH F trn U lun
tn ti mt ph G ca F sao cho mi PTH trong G u
l ph thuc y :
chnh l ph thu gn tri ca F(?).

4.27. Xy dng thut ton tm mt ph y ca
tp PTH F: Xem bi 4.21.

Nguyn Xun
_________________________________________________________________
___

107
4.28. Cho quan h R trn U v cc tp con thuc
tnh X, Y ca U. Chng minh:
a) R(X (s) Y) R(X Y)
u,v e R, u.X = v.X (gt)
u.Y = v.Y (v R(X (s)Y))
R( XY), pcm

b) R(X Y) R(X (w)Y)
u,v e R: u.X = v.X (gt)
u.Y = v.Y (v R(X Y))
R(X (w)Y), pcm

c) R(X (d) Y) R(X (w)Y)
u,v e R, u.X = v.X (gt)
- BeY: u.B = v.B (v R(X (d)Y))
R(X (w)Y), pcm

d) R(X (s) Y) R(X (d) Y)
u,v e R, - AeX: u.A = v.A (gt)
u.Y = v.Y (v R(X (s)Y))
R(X (d)Y), pcm

4.29. Vi mi tp con thuc tnh X, Y, Z v thuc
tnh A trn tp thuc tnh U. in cc k hiu f,
s, w hoc d thay cho du ? khng nh cc tnh
cht cao nht ca cc ph thuc mnh, yu hoc i
ngu sau y:
1. Tnh phn x: Nu Y _ X th X (f) Y
2. Tnh gia tng: Nu X (f) Y th XZ (f) YZ
3. Tnh bc cu: Nu X (s) Y v Y (s) Z th X
(s) Z
4. Tnh ta bc cu: Nu X (s)Y, YZ (s)V th
XZ (s)V
Nguyn Xun
_________________________________________________________________
___

108
5. Tnh phn x cht: X (d) X v X (f) X
6. M rng v tri v thu hp v phi:
Nu X (f)Y th XZ (f) Y \ V
7. Cng tnh y : Nu X (f)Y v Z (f)V th
XZ (f)YV
8. M rng v tri: Nu X (f)Y th XZ (f)Y
9. Cng tnh v phi: Nu X (s)Y v X (s)Z
th X (s)YZ
10. B phn v phi: Nu X (s)YZ th X
(s)Y.
11.Tnh tch lu: Nu X (s)YZ, Z (s)AV th X
(s)YZA

4.30. Xy dng thut ton tm mt kha ca LQH.

T- t-ng: Xut pht t mt siu kha K ty ca
LQH, duyt ln l-t cc thuc tnh A ca K, nu
bt bin (K-{A})
+
= U -c bo ton th loi A khi
K. C th thay kim tra (K-{A})
+
= U bng kim tra
A e (K-{A})
+
(?).

Algorithm Key
Format: Key(U,F)
Input: - Tp thuc tnh U
- Tp PTH F
Output: - Kha K _ U tha
- K
+
= U
- A e K: (K-{A})
+
= U
Method
K:=U;
for each attribute A in U do
if A e(K-{A})
+
then
K := K-{A}
Nguyn Xun
_________________________________________________________________
___

109
endif;
endfor;
return K;
end Key;

4.31. Cho LQH p. Bit p c mt kha K. Hy xy
dng thut ton tm mt kha th hai M ca p. Nu p
khng c kha th hai thut ton cho kt qu l mt
tp rng.

T- t-ng: Xut pht t mt siu kha M ty , tr-c
ht duyt cc thuc tnh A ca K, nu bt bin (M-
{A})
+
= U -c bo ton th loi A khi M. Sau
duyt t-ng t vi cc thuc tnh trong U-K.

Algorithm Key2
Format: Key2(U,F)
- Tp PTH F
- Kha K _ U
Output: - Kha th hai, nu c, M _ U tha
- M
+
= U
- A e M: (M-{A})
+
= U
Nu khng c kha th hai: C.
Method
M:=U;
for each attribute A in K do
if A e(M -{A})
+
then
M := M -{A}
endif;
endfor;
for each attribute A in U-K do
if A e(M -{A})
+
then
M := M -{A}
endif;
endfor;
Nguyn Xun
_________________________________________________________________
___

110
if M = K then return C
else return M;
endif
end Key2;

4.32. Xy dng mt LQH c 5 thuc tnh ABCDE, mi
thuc tnh l mt kha:
p = (U,F}; U = ABCDE; F = {AB, BC, CD, DE,
EA}.

Ta c xeU: x
+
= U (?), do x l mt kha ca p.

Ch : Tp PTH F c dng nh- trn -c gi l tp
ph thuc hm dng vng.

4.33. LQH c 5 thuc tnh c th c ti a bao
nhiu kha. Cho th d.
10 kha, th d, p = (U,F); U = ABCDE; F =
{ABCDE, ACBDE, ADBCE, AEBCD, BCADE,
BDACE, BEACD, CDABE, CEABD, DEABC}. D thy
mi v tri to ra mt kha (?)

4.34. Xy dng mt LQH c 5 thuc tnh ABCDE v
ch c mt kha duy nht. p = (U,F); U = ABCDE; F =
{ABCDE}.

4.35. (Nguyn Xun Huy) Cho K l mt kha ca LQH
p = (U,F). Chng minh rng vi mi tp con X ca K
ta c: X
+
K = X.
Nguyn Xun
_________________________________________________________________
___

111
V X _ X
+
v X _ K nn X _ X
+
K. Ta cn chng
minh X
+
K _ X. Gi s Ae X
+
K v A e X. Ta
xt tp M = K-{A}. D thy X _ M (?).

Ta c, theo
tnh cht ng bin ca bao ng: A e X
+
_ M
+
. T
y suy ra M
+
_ K nn M
+
= U(?), tc l M l b phn
thc s ca kha K li ng thi l siu kha, tri
vi nh ngha kha. Vy Ae X. pcm.

Ch : Tnh cht trn l mt c tr-ng ca cc
thuc tnh nguyn thy (thuc tnh kha).

4.36. (L Vn Bo, Nguyn Xun Huy, H Thun) Cho
LQH p = (U,F). Gi M l giao ca cc kha ca p.
Chng minh rng
F R L
L R U M
e
= ) (
Nguyn Xun
_________________________________________________________________
___

112

Chng minh

Tr-c ht rng cc PTH LR v L(R-L) l
t-ng -ng do ta c th gi thit rng mi PTH
trong F u c dng LR, L R=C (xem thm bi
4.19). Do gi thit ny ta c R-L=R. D nhn thy M
l tp cc thuc tnh khng c mt trong v phi
ca mi PTH trong F (?) do chng phi c mt
trong mi kha (?). Gi s A l mt thuc tnh c
trong v phi ca PTH LAR' ca F. Ta chng minh
A s khng xut hin trong mt kha K no y ca
p. Tht vy, xt tp X = U-A. D thy X _ L (?) v
X l siu kha (?). T siu kha X khng cha A (?)
ta ly ra -c mt kha K. K khng cha A (?).

4.37. (L Vn Bo, H Thun)Cho LQH p = (U,F).
Gi M l giao ca cc kha ca p. Chng minh rng p
c mt kha duy nht khi v ch khi M
+
= U.

Chng minh:

Nu M
+
= U th M l siu kha v M khng th cha
thc s mt kha (?), tc l M l mt kha. V M l
giao ca cc kha ng thi li l kha nn p khng
th cn kha no khc ngoi M. Ng-c li, nu p ch
c mt kha duy nht M th giao ca cc kha -ng
nhin l M, v do , theo tnh cht ca kha M
+
=
U.

4.38. Cho tp thuc tnh U vi n phn t. Chng
minh rng c th xy dng tp PTH F sao cho LQH p
= (U,F) c

C
n
n
2
kha,
trong ton t x cho ta cn nguyn d-i ca s
nguyn x,
Nguyn Xun
_________________________________________________________________
___

113
C
m
n
l t hp chp m ca n phn t.

Gi : Gi s U = {A
1
, A
2
,...,A
n
}, n > 0. Xy dng
tp PTH F = {L
i
U-L
i
| i = 1...m}, trong mi L
i
l mt t hp chp n / 2 ca n. Chng ming rng
mi v tri L
i
l mt kha.

4.39. Tm tp thuc tnh nguyn thu ca LQH sau:
p = (U,F), U = ABCDE,
F = { AB C, AD B, B D }.

L-c p c giao cc kha l: AE, m (AE)
+
= AE =
U nn p c trn 1 kha, c th l 2 kha: ABE v
ADE. Vy tp thuc tnh nguyn thy l U
k
= ABE
ADE = ABDE.

4.40. Khng nh hoc bc b tnh ng ca cc mnh
sau:

a) K _ U l mt kho khi v ch khi K + U
(ph thuc y ): ng.

b) Hai kho khc nhau ca mt LQH khng giao
nhau: sai, xem bi 4.39.

c) Hai kho khc nhau ca mt LQH khng bao
nhau: ng.

d) Mi LQH u c t nht mt kho: ng.

e) Tn ti mt LQH khng c kho no: sai.

f) S kho ca mt LQH khng th ln hn s
thuc tnh: sai, xem bi 4.33.

Nguyn Xun
_________________________________________________________________
___

114
g) U khng th l kho ca LQH (U,F): sai; khi
F = C hoc F ch cha cc PTH tm th-ng th U
l kha.

h) Mi LQH khng th c hai kho n tc l
kho ch gm mt thuc tnh: sai, xem bi 4.32.
Nguyn Xun
_________________________________________________________________
___

115

Bi gii ch-ng 5
Chun ha

5.1. Chng minh rng nu X Y v X Y = C th
php tch (XY,
U-Y) l khng tn tht.

Chng minh

t M=XY, Z=U-Y, ta c MZ=U v M Z = X. Ta cn
chng minh ReSAT(XY): R[M]-R[Z]=R. Theo bi 1.33
ta c R[M]-R[Z] _ R, ta cn phi chng minh
R[M]-R[Z] _ R. Gi s ueR[M], veR[Z] v u v v tho
iu kin kt ni t nhin, tc l u.X = v.X, ta
chng minh u-veR. V ueR[M] nn - u'eR: u = u'.M.
V veR[Z] nn - v'eR: v = v'.Z. V X = M Z nn
X _ M v X _ Z, t suy ra u.X = u'.M.X = u'.X =
v.X = v'.Z.X = v'.X. V R tha PTH XY nn t u'.X
= v'.X ta suy ra u'.Y = v'.Y v do u'.M = u'.XY
= v'.XY = v'.M. T y suy ra u-v = v' e R, pcm.

5.2. Dng k thut bng kim tra tnh tn tht
ca cc php tch sau:

a) p = (U,F), U = ABCD,
F = { A B, AC D }
= (AB, ACD).

Nguyn Xun
_________________________________________________________________
___

116

T T*
A B C D
AB a
1
a
2
b
13
b
14
ACD a
1
b
22
/ a
2
a
3
a
4

V T* cha dng th hai gm ton k hiu phn bit
nn php tch cho l khng tn tht.

b) p = (U,F), U = ABCDE,
F = { A C, B C, C D, DE C, CE A }
= (AD, AB, BE, CDE).

T T*
A B C D
E
AD a
1
b
12
b
13
/ a
3
a
4
b
15
AB a
1
a
2
b
23
/b
13
/a
3
b
24
/ a
4
b
25
BE b
31
a
2
b
33
/b
13
/a
3
b
34
/ a
4
a
5
CDE b
41
/
b
31
b
42
a
3
a
4
a
5

V T* khng cha mt dng ton k hiu phn bit
nn php tch cho l tn tht.

5.3. Mt l-c quan h dng chun 3 v c mt
V sao?
C.

Chng minh: Gi s L p 3NF, c mt kha duy nht
K nh-ng khng BCNF. Vy phi c mt PTH khng tm
Nguyn Xun
_________________________________________________________________
___

117
th-ng XA, AeX sao cho X khng phi l siu kha.
Ta c KX v K l kha, X ! K v X khng phi l
siu kha. Nu A khng phi l thuc tnh kha th
ph thuc bc cu KX, X !K, XA, Ae X chng t
L cho khng 3NF. Vy A phi l thuc tnh
kha, tc l A nm trong kha duy nht K. Xt tp M
= (K-A)X. V M _ X nn theo tin phn x
Armstrong MX, mt khc XA theo gi thit nn
theo tin bc cu Armstrong ta suy ra MA. Khi
M
+
cha A v do cha K. Tc l M l siu kha
khng cha A. T siu kha ny ta c th tm -c
mt kha K' = K (v K cha A m K' khng cha A).
Hai kha ny mu thun vi iu kin kha K l duy
nht. Vy gi thit v s tn ti PTH khng tm
th-ng XA, AeX sao cho X khng phi l siu kha
l sai. L phi dng BCNF, pcm.

5.4. Xc nh v gii thch dng chun cao nht ca
LQH sau:
p = (U, F); U = ABCD, F = { A C, D B, C
ABD }.
L p c 2 kho l A v C v A
+
= C
+
= ABCD = U. Tp
thuc tnh kho l U
k
= AC, tp thuc tnh khng
kho l U
0
= BD. Ta c, CD (?), D ! C (?), DB.
y l ph thuc bc cu ca thuc tnh khng kho
B vo kho C. Vy p khng phi l 3NF v -ng
nhin p khng phi l BCNF(?). V hai kho A v C
u ch c mt thuc tnh nn cc thuc tnh khng
kho khc l B v D u ph thuc y vo hai
kho ny. Vy p l 2NF.

5.5. Chng minh rng mt LQH dng chun 3 th
ng thi dng chun 2.

Chng minh: Nu A l thuc tnh khng kho v A
khng ph thuc y vo kho K th ta c - M c
Nguyn Xun
_________________________________________________________________
___

118
K: MA. Khi M ! K (?), A eM (?). y l mt
ph thuc bc cu, mu thun vi gi thit v 3NF.
Vy mi thuc tnh khng kho phi ph thuc y
vo mi kho, tc l l-c phi l 2NF.

5.6. Chng minh rng mt LQH dng chun BC th
ng thi dng chun 3.

Chng minh: Suy trc tip t nh ngha.

5.7. Chun ho 3NF CSDL Thc tp:
vi cc tp PTH sau:
F
SV
= {SV# HT, NS, QUE, HL}
F
DT
= {DT# TDT, CN, KP}
F
SD
= {SV#, DT# NTT, KQ ; NTT KM}
Gii

Hai quan h SV v DT ch c 1 kho n (1 thuc
tnh) t-ng ng l SV# v DT# v hai tp PTH t-ng
ng ch cha 1 PTH nn hai quan h ny BCNF(?).

Quan h SD c 1 kho l K = SV#DT#. SD khng 3NF
v c ph thuc bc cu ca thuc tnh khng kho
KM vo kho K. Ta chun ho SD nh- sau:
1. Tch
SV#, DT# NTT
SV#, DT# KQ
NTT KM
2. Tm ph ti tiu
G = { SV#, DT# NTT; SV#, DT# KQ; NTT
KM }
3. Gp: ta thu li -c F
Nguyn Xun
_________________________________________________________________
___

119
4. Kt qu: = (SV#,DT#,NTT,KQ ; NTT, KM). Ta
thu -c hai quan h
SD(SV#,DT#,NTT,KQ) vi kho K=SV#,DT# v
NK(NTT,KM) vi kho NTT

5.8. Chun ho 3NF LQH p = (U,F) sau:

U = MLTGSDP,
F = { M T, GP M, GT P, MS D, GS P}
vi ng ngha sau:

M: Mn hc chuyn
L: Lp chuyn
T; Thy - gio vin ph trch chuyn
G: Gi hc chuyn
S: Sinh vin theo hc chuyn
D: S ng k ca sinh vin trong chuyn
P: Phng hc dnh cho chuyn
M T: Mi chuyn c mt thy ph trch
GP M: Ti mi thi im, mi phng hc -c dnh
cho khng qu mt mn
GT P: Ti mi thi im, mi thy dy trong
khng qu mt phng hc
MS D: Mi sinh vin tham gia chuyn no th
-c cp mt m s ghi danh theo chuyn
GS P: Ti mi thi im, mi sinh vin c mt
trong khng qa mt phng hc

1. Tm mt kho: Tp thuc tnh c trong mi kho
K = LGS. Ta c K
+
= (LGS)
+
= LGSPMTD = U do l-c
p c mt kho duy nht l K. Tp cc thuc tnh
kho: U
k
= LGS, tp cc thuc tnh khng kho: U
0
=
PMTD.

2. V b phn thc s ca kho K l GS v GSP, P
e U
0
nn p khng 2NF v do khng 3NF.
Nguyn Xun
_________________________________________________________________
___

120

3. rng F dng ti tiu, ta c:
= (MT, GPM, GTP, MSD, GSP)
Kho K = LGS khng c trong thnh phn no ca
nn ta thm K vo thu -c kt qu sau:
= (MT, GPM, GTP, MSD, GSP, LGS)

5.9. Chng minh s t-ng -ng ca hai nh ngha d
v e v BCNF.

d) dng chun 3 mnh hoc Boyce-Codd (3SNF, BCNF)
nu p 1NF v mi thuc tnh u ph thuc trc
tip vo mi kho,

e) dng chun 3 mnh hoc Boyce-Codd (3SNF, BCNF)
nu p 1NF v mi PTH khng tm th-ng XY u
cho ta X l mt siu kha.

Chng minh

[d e] Gi s l-c p 1NF v mi thuc tnh
u ph thuc trc tip vo mi kho v XY l mt
PTH khng tm th-ng. Ta phi chng minh X l mt
siu kho. V PTH X Y khng tm th-ng nn ta
phI c X A vi A e Y\X. Nu X khng phI l
siu kho th vi mi kho K ta c X ! K, K X,
X A, A e X, tc l A ph thuc bc cu vo kho
K, mu thun vi nh ngha d. Vy X phi l siu
kho, tc l ta c e, pcm.

[e d] Gi s l-c p 1NF v mi PTH khng
tm th-ng X Y u cho ta X l mt siu kho.
Cho kho K ca p v mt thuc tnh A trong U. Gi
s A ph thuc bc cu vo K, tc l - X _ U: K
X, X ! K, X A, A e X. Nh- vy X A l PTH
Nguyn Xun
_________________________________________________________________
___

121
khng tm th-ng nn ta phi c X l mt siu kho
ca p v do X K, mu thun vi gi thit v
ph thuc bc cu. Vy mi thuc tnh A phi ph
thuc trc tip vo mi kho ca p, tc l ta c d,
pcm.
Nguyn Xun
_________________________________________________________________
___

122

Bi gii

Cc thi
Nguyn Xun
_________________________________________________________________
___

123
bi gii
thi tuyn cao hc i hc thi nguyn
nm 2002
Mn: C s cng ngh thng tin,

Cu 5.
a.1) nh ngha quan h:
Cho tp hu hn U = {A
1
, A
2
, ... , A
n
} khc trng
(n > 1). Cc phn t ca U -c gi l thuc tnh.
ng vi mi thuc tnh A
i
e U, i = 1,2, ..., n c
mt tp khng rng dom(A
i
) -c gi l min tr
(min bin thin) ca thuc tnh A
i
. Ta t
( ) dom
A
i
U
A
i
D
e
=
Mt quan h R vi cc thuc tnh U = { A
1
, A
2
, ...
, A
n
}, k hiu l
R(U), l mt tp cc nh x t: U D sao cho vi
mi A
i
e U ta c t(A
i
) e dom(A
i
). Mi nh x -c
gi l mt b ca quan h R.
a.2) nh ngha ph thuc hm:
Cho tp thuc tnh U. Mt ph thuc hm (PTH) trn
U l cng thc dng f: X Y; X, Y _ U.
ging nhau trn Y,
( u,v e R): (u.X = v.X) (u.Y = v.Y)
b.1) Pht biu h tin Armstrong:
Cho tp PTH F trn tp thuc tnh U. Bao ng ca
F, k hiu F
+
l tp nh nht cc PTH trn U cha F
v tho cc tnh cht F1-F3 ca h tin
Armstrong A
o
sau y:
F1. Tnh phn x: Nu X _ Y th X Y e F
+

F2. Tnh gia tng: Nu XY e F
+
th XZYZ
e F
+

Nguyn Xun
_________________________________________________________________
___

124
F3. Tnh bc cu: Nu X Y e F
+
v Y Z e
F
+
th X Z e F
+
Nu f e F
+
ta ni tp PTH F dn ra -c PTH f theo
tin Armstrong.
Cho tp PTH F trn tp thuc tnh U v f l mt
PTH trn U . Ta ni PTH f -c suy dn theo quan h
t tp PTH F, nu mi quan h R(U) tho F th R
cng tho f. Ta k hiu F * l tp ton b cc PTH
f -c suy dn theo quan h t tp PTH F.
b.2) Pht biu tnh ng ca h tin Armstrong:
nh l: Cho tp PTH F trn tp thuc tnh U v mt
PTH f trn U. Nu f -c dn t F theo tin
Armstrong th f cng -c dn t F theo quan h,
tc l F
+
_ F
*
.
c.1) nh ngha l-c quan h: L-c quan h
(LQH) l mt cp p = (U,F), trong U l tp hu
hn cc thuc tnh, F l tp cc ph thuc hm trn
U.
c.2) nh ngha kho ca l-c quan h: Cho LQH
p = (U,F). Tp thuc tnh K _ U -c gi l kho
ca L p nu
(i) K
+
= U
(ii) A e K: (K - {A})
+
= U
d.1) Pht biu bi ton thnh vin i vi l-c
quan h: Cho tp thuc tnh U, mt tp cc PTH F
trn U v mt PTH f: X Y trn U. Hi rng X
Y e F
+
hay khng ?
d.2) Kt qu lin quan ti bi ton thnh vin:
nh l : X Y e F
+
khi v ch khi Y _ X
+
.
V c thut ton tm bao ng ca tp thuc tnh
vi phc tp thi gian a thc nn nh l trn
cho ta thut ton gii bi ton thnh vin vi
phc tp thi gian a thc.

Cu 6.
a.1) Thut ton tnh bao ng ca mt tp thuc
tnh trong mt l-c quan h:
Nguyn Xun
_________________________________________________________________
___

125
t-ng: Cho tp PTH F trn tp thuc tnh U v mt
tp con cc thuc tnh X trong U. xc nh bao
ng ca tp thuc tnh X, X
+
ta xut pht t tp X
v b sung dn cho X cc thuc tnh thuc v phi R
ca cc PTH L R e F tha iu kin L _ X.
Thut ton s dng khi khng th b sung thm thuc
tnh no cho X.
Algorithm Closure
Format: C = X

+

- Tp thuc tnh X _ U
Output: - Y = X

+
= { A e U | X A }
Method
Y:=X;
repeat
Z:=Y;
if L _ Y then
Y:=Y R;
endif;
endfor;
until Y=Z;
return Y;
end Closure;
b) Thut ton tm mt kho ca l-c quan h:
T- t-ng: Xut pht t mt siu kha K, loi dn
cc thuc tnh trong K, bo ton bt bin K
+
= U.
Algorithm Key
Format: Key(U,F)
- Tp PTH F
- K
+
= U
- A e K: (K-{A})
+
= U
Method
K:=U;
Nguyn Xun
_________________________________________________________________
___

126
if (K-{A})
+
= U then
K := K-{A}
endif;
endfor;
return K;
end Key;
c) Cho l-c quan h s = (R,F) vi R = abcdefg, F
= { abc de, bcd g, abf eg, ce fg }
Tm mt kho ca l-c s.
LQH s c kha K = abc, v:
(abc)
+
= abcdefg = U v (bc)
+
= bc = U, (ac)
+
= ac
= U, (ab)
+
= ab = U.
________________________

Nguyn Xun
_________________________________________________________________
___

127
bi gii
nm 2002
s 1

Cu 1.
1.a) nh ngha l-c quan h: L-c quan h
(LQH) l mt cp p = (U,F), trong U l tp hu
hn cc thuc tnh, F l tp cc ph thuc hm trn
U.
1.b) nh ngha bao ng ca tp thuc tnh trong
LQH:
cc thuc tnh X trong U. Bao ng ca tp thuc
tnh X, k hiu X
+
l tp thuc tnh X
+
= { A

e U |
X A e F
+
}
1.c) Thut ton tm bao ng ca tp thuc tnh
trong LQH:
t-ng: Cho tp PTH F trn tp thuc tnh U v
mt tp con cc thuc tnh X trong U. xc nh
bao ng ca tp thuc tnh X, X
+
ta xut pht t
tp X v b sung dn cho X cc thuc tnh thuc v
phi R ca cc PTH L R e F tha iu kin L _
X. Thut ton s dng khi khng th b sung thm
thuc tnh no cho X.
Algorithm Closure
Format: C = X

+

- Tp thuc tnh X _ U
Output: - Y = X

+
= { A e U | X A e F
+
}
Method
Y:=X;
repeat
Z:=Y;
if L _ Y then
Nguyn Xun
_________________________________________________________________
___

128
Y:=Y R;
endif;
endfor;
until Y=Z;
return Y;
end Closure;
ABCDEGH v tp ph thuc hm F = { CD H, E B,
D G, BH E, CH DG, C A }.
a. Tm tp M l giao ca ton b cc kho ca p:

b. Cho bit p c ng 1 kho hay khng?
V C
+
= CA = U nn LQH p c hn 1 kha.
c. Tp ABD c phi l kho ca p khng? V sao?
ABD khng phi l kha ca p v n khng cha C
l phn c mt trong mi kha.
d. Tp CH c phi l kho ca p khng? V sao?
Tp CH khng phi l kho ca p v (CH)
+
=
ACDGH = U.
e. Tnh Z = (X
+
Y)
+
(K
+
- Y) bit X = CD, Y =
CH, K l mt siu kho ca p.
V K l siu kha nn K
+
= U, do K
+
-Y =
ABCDEGH-CH = ABDEG. Ta li bit (X
+
Y)
+
= (X
Y)
+
= (CDH)
+
=ACDGH, nn
Z = ACDGH ABDEG = ADG.
Cu 3. Php phn tch mt LQH:
3.a) Cho l-c quan h p = (U,F). Mt php tch
trn tp thuc tnh U l mt h cc tp con ca U
= (X
1
, X
2
,...,X
k
) tha tnh cht
U
k
i
i X
1 =
.
Php tch = (X
1
, X
2
,...,X
k
) trn tp thuc tnh U
-c gi l khng tn tht (hoc khng mt thng
tin) i vi tp PTH F nu
Nguyn Xun
_________________________________________________________________
___

129
R(U) e SAT(F): R[X
1
] - R[X
2
] - ... - R[X
k
] = R.
Ng-c li, nu khng tn ti ng thc th ta gi
l php tch tn tht.
Kim tra tnh tn tht ca php tch bng k thut
bng
Input
- LQH p = (U,F)
- Php tch = (X
1
, X
2
,...,X
k
)
Output
- True, nu l mt php tch khng tn tht
- False, ngoi ra.
Method
1. Khi tr: Lp bng T vi cc ct l cc thuc
tnh trong U v k dng, mi dng ng vi mt thnh
phn ca X
i
trong : Dng i cha cc k hiu phn
bit (KHPB) a
j
ng vi cc thuc tnh A
j
trong X
i
v cc k hiu khng phn bit (KHKPB) b
ij
ng vi
cc thuc tnh A
j
trong U-X
i
. Ch rng mi KHPB
trong ct j ca T l ging nhau v bng a
j
cn mi
KHKPB trong bng T lc u l khc nhau.
2. Sa bng: Lp n khi bng T khng cn thay i:
2.1. Vn dng cc F-lut bin i bng nh-
sau:
Vi mi PTH L R trong F, nu trong bng T
c cha hai dng u v v ging nhau trn L th sa
cc k hiu ca chng cho ging nhau trn mi thuc
tnh A trong R nh- sau:
a) nu u.A = v.A: khng sa,
b) nu ch mt trong hai i l-ng u.A
hoc v.A l KHPB th sa k mi xut hin trong
bng ca KHKPB thnh KHPB ,
c) nu c hai i l-ng u.A v v.A u l
KHKPB th sa mi xut hin trong bng ca k hiu
c ch s th nht ln hn thnh k hiu th hai.
3. Kt lun:
Gi bng kt qu l T
*
.
Nguyn Xun
_________________________________________________________________
___

130
Nu T
*
cha mt dng ton KHPB th return True nu
khng return False.
end.
3.c) Cho LQH p nh- trong cu 2. Vn dng thut
ton kim tra php phn tch w c mt thng tin hay
khng?
Gi thit
p = (U, F),
U = ABCDEGH,
F = { CD H, E B, D G, BH E, CH DG,
C A }.
w = [ABCDE,BCH,CDEGH]
T T
*

A B C D E G H
ABCDE a
1
a
2
a
3
a
4
a
5
b
16
/
a
6
b
17
/
a
7
BCH b
21
/a
1
a
2
a
3
b
24
/a
4
b
25
/
a
5
b
26
/
a
6
a
7

CDEGH b
31
/a
1
b
32
/a
2
a
3
a
4
a
5
a
6
a
7

Do T c cha dng ton k hiu phn bit nn php
tch w cho l khng tn tht.
Cu 4.
4.a) nh ngha cc dng chun 2NF, 3NF v BCNF ca
LQH:
a) dng chun 1 (1NF) nu mi thuc tnh trong U
u khng phi l thuc tnh phc hp,
b) dng chun 2 (2NF) nu p 1NF v mi thuc
tnh khng kho u ph thuc y vo mi kho,
c) dng chun 3 (3NF) nu p 1NF v mi thuc
tnh khng kho u ph thuc trc tip vo mi
kho,
Nguyn Xun
_________________________________________________________________
___

131
4.b) S t-ng quan gia cc dng chun:
BCNF 3NF 2NF
4.c) Xc nh dng chun cao nht ca LQH h sau
y:
h = (U, F); U = ABCD, F = { D B, C A, B
ACD }
Gii thch v sao?
L-c h c 2 kha K
1
= D; K
2
= B v D
+
=ABCD v
B
+
=ABCD.
V c PTH C A m C khng phi l siu kha nn
h khng th dng chun BCNF.
Tp thuc tnh kha l U
K
= BD; Tp thuc tnh
khng kha l U
0
= AC;
Ta c :
B C (v B l kha),
C ! B (v C khng l kha)
C A (gi thit)
v A l thuc tnh khng kha. Nh- vy thuc tnh
khng kha A ph thuc bc cu vo kha B nn h
khng dng chun 3NF.
Hai thuc tnh khng kha A v C u ph thuc y
vo cc kha B v D do l-c h dng chun
2NF.
____________________________
Nguyn Xun
_________________________________________________________________
___

132

bi gii
nm 2002
s 2

Cu 1.
1.a) nh ngha PTH: Cho tp thuc tnh U. Mt ph
thuc hm (PTH) trn U l cng thc dng f: X
Y; X, Y _ U.
ging nhau trn Y,
( u,v e R): (u.X = v.X) (u.Y = v.Y)
1.b) nh ngha LQH: L-c quan h (LQH) l
mt cp p = (U,F), trong U l tp hu hn cc
thuc tnh, F l tp cc ph thuc hm trn U.
1.c) Pht biu bi ton thnh vin trn LQH: Cho
tp thuc tnh U, mt tp cc PTH F trn U v v
mt PTH f: X Y trn U. Hi rng
X Y e F
+
hay khng ?
1.d) iu kin cn v lin quan n bi ton
thnh vin:
nh l: X Y e F
+
khi v ch khi Y _ X
+
.
Cu 2.
2.a) nh ngha kho ca LQH: Cho LQH p = (U,F).
Tp thuc tnh K _ U -c gi l kho ca L p
nu
(i) K
+
= U
(ii) A e K: (K - {A})
+
= U
2.b) Thut ton tm 1 kho ca LQH:
+
= U.
Algorithm Key
Nguyn Xun
_________________________________________________________________
___

133
Format: Key(U,F)
- Tp PTH F
- K
+
=U
- A e K: (K-{A})
+
= U
Method
K:=U;
if (K-{A})
+
= U then
K := K-{A}
endif;
endfor;
return K;
end Key;
Cu 3.
3.a) nh ngha thuc tnh kho (thuc tnh c bn
hay nguyn thu), thuc tnh khng kho (thuc tnh
th cp): Cho LQH p = (U,F). Thuc tnh A trong U
-c gi l thuc tnh kha nu A c trong mt
kha ca p. A -c gi l thuc tnh khng kha nu
A khng c trong bt k kha no ca p.
3.b) Cho LQH
s = (U, F), trong U = ABCD, F = { AD BC, B
A, D C }.
a) Tm cc kho ca s: L-c s c 2 kha:
K
1
= BD, v (BD)
+
= U; B
+
= AB = U; D
+
= CD = U.
K
2
= AD; v (AD)
+
= U; A
+
= A = U v D
+
= U;
b) Cho bit C c phi l thuc tnh kho hay
khng? C khng phi l thuc tnh kha ca s v C
khng c trong kha no.
Cu 4.
4.a) nh ngha cc dng chun 2NF, 3NF v BCNF ca
LQH: LQH p = (U,F) -c gi l
a) dng chun 1 (1NF) nu mi thuc tnh trong U
u khng phi l thuc tnh phc hp,
Nguyn Xun
_________________________________________________________________
___

134
b) dng chun 2 (2NF) nu p 1NF v mi thuc
tnh khng kho u ph thuc y vo mi kho,
c) dng chun 3 (3NF) nu p 1NF v mi thuc
tnh khng kho u ph thuc trc tip vo mi
kho,
4.b) S t-ng quan gia cc dng chun:
BCNF 3NF 2NF.
4.c) Xc nh dng chun cao nht ca LQH h sau:
h = (U, F); U = ABCD, F = { CD B, A C, B
ACD }
Gii thch v sao?
L-c h c 3 kha: K
1
= B, v B
+
= U;
K
2
= CD, v (CD)
+
= U, C
+
= C = U, D
+
= D = U.
K
3
= AD, v (AD)
+
= U, A
+
= AC = U, D
+
= D = U.
Tp thuc tnh kha l U
K
= ABCD = U, vy h khng
c thuc tnh khng kha.
Ta c PTH A C m A khng phi l siu kha
nn h khng th dng chun BCNF.
Do h khng c thuc tnh khng kha nn khng c
ph thuc bc cu ca thuc tnh khng kha vo cc
kha. Vy h dng chun 3NF.
ABCDEHG v tp ph thuc hm F = { DE G, H C,
E A, CG H, DG EA, D B }.
M = U - ABCGEH = D. M
+
= D
+
= BD = U nn p c hn
1 kha.
b. Tm 1 kho ca p: K = DEH, v (DEH)
+
=
DEHGCAB,
(DE)
+
= DEGAB = U, (DH)
+
= DHCB = U, (EH)
+
= EHAC
= U.
Nguyn Xun
_________________________________________________________________
___

135
c. Tp BCE c phi l kho ca p khng? V sao?
Khng, v BCE khng cha D l giao cc kha.
d. Hy thm hoc bt 1 ph thuc hm cho F
LQH c ng 1 kho. Thm chng hn PTH
DABCEGH. Khi D vn l giao cc kha v D
+
=
U nn p c ng 1 kha.
_____________________________
Nguyn Xun
_________________________________________________________________
___

136

bi gii
i hc bch khoa h ni
nm 2002

Bi 1.
1a) nh ngha l-c quan h: LQH l mt cp p =
(U,F) trong U l tp hu hn cc thuc tnh, F
l tp PTH trn U.
1b) nh ngha kho ca l-c quan h: Cho LQH p
= (U,F). Kha ca LQH l tp con thuc tnh K ca
U tha
(i) K
+
= U
(ii) A e K: (K-{A})
+
= U.
1c) Thut ton tm mt kho ca l-c quan h:
+
= U.
Algorithm Key
Format: Key(U,F)
- Tp PTH F
- K
+
=U
- A e K: (K-{A})
+
= U
Method
K:=U;
if (K-{A})
+
= U then
K := K-{A}
endif;
endfor;
return K;
end Key;
Bi 2. Cho l-c quan h p = (U,F) vi tp thuc
tnh U = ABCDEH v tp ph thuc hm F = { BC E,
D A, C A, AE D, BE CH }.
Nguyn Xun
_________________________________________________________________
___

137
a) Tm mt kho K ca l-c p: L p c kha K =
BC v
(BC)
+
= BCEADH = U, B
+
= B = U, C
+
= CA = U.
b) Ngoi kho K, l-c p cn kho no khc
khng? V sao?
Giao ca cc kha: M = U - EADCH = B; M
+
= B
+
= B
= U. Vy L c hn 1 kha.
c) Tp BCH c phi l kho ca p khng? V sao?
BCH khng phi l kha ca p v BCH cha thc s
kha K = BC tm -c cu a.
d) Tp BD c phi l kho ca p khng? V sao?
(BD)
+
= BDA = U nn BD khng phi l kha ca p.
e) Tnh Z = (X
+
Y)
+
K
+
- (X

Y) vi X = AB, Y
= D, K l mt siu kho ca p: V K l siu kha
nn K
+
= U, mt khc (X
+
Y)
+
= (X

Y)
+
, do Z
= (X

Y)
+
- (X

Y) = (ABD)
+
- ABD = ABD-ABD = C.
f) Hy thm cho F mt ph thuc hm p c ng
mt kho. Gii thch cch lm: V giao cc kha
l B nn ta c th thm PTH BACDEH. Khi giao
cc kha vn l B v ta c B
+
= U nn L c ng
1 kha.
Bi 3. Mt l-c quan h dng chun 3 v c mt
V sao? C.
Chng minh: Gi s L p 3NF, c mt kha duy nht
K nh-ng khng BCNF. Vy phi c mt PTH khng tm
th-ng XA, AeX sao cho X khng phi l siu kha.
Ta c KX v K l kha, X ! K v X khng phi l
siu kha. Nu A khng phi l thuc tnh kha th
ph thuc bc cu KX, X !K, XA, Ae X chng t
L cho khng 3NF. Vy A phi l thuc tnh
kha, tc l A nm trong kha duy nht K. Xt tp M
= (K-A)X. V M _ X nn theo tin phn x
Armstrong MX, mt khc XA theo gi thit, nn
theo tin bc cu Armstrong ta suy ra MA. Khi
M
+
cha A v do cha K. Tc l M l siu kha
Nguyn Xun
_________________________________________________________________
___

138
khng cha A. T siu kha ny ta c th tm -c
mt kha K' = K (v K cha A m K' khng cha A).
Hai kha ny mu thun vi iu kin kha K l duy
nht. Vy gi thit v s tn ti PTH khng tm
th-ng XA, AeX sao cho X khng phi l siu kha
l sai. L phi dng BCNF, pcm.
______________________
Nguyn Xun
_________________________________________________________________
___

139
bi gii
Mn: C s d liu, s 1


Cu 1.
a) nh ngha php ton tr hai quan h:
Php tr (theo l thuyt tp hp hoc ly phn
ring) hai quan h t-ng thch R(U) v S(U), k
hiu R-S, cho ta quan h cha cc b ca quan h R
khng c trong quan h S,
P(U) = R-S = { t | t e R, t e S }
b) Thut ton xc nh php ton tr hai quan h
Algorithm Substraction
Format: P = R-S
- Quan h S(U)
Output: - Quan h R-S={t|teR . teS}
Method
Create(P,Attr(R));
with u not_in S do
add u to P;
endfor;
return P;
end Substraction;
Cu 2.
a) nh ngha LQH: L-c quan h (LQH) l mt
cp p = (U,F), trong U l tp hu hn cc
Nguyn Xun
_________________________________________________________________
___

140
b) nh ngha bao ng ca tp thuc tnh
trong LQH: Cho LQH p = (U,F), trong U l tp
thuc tnh, F l tp PTH trn U. Bao ng ca tp
thuc tnh X, k hiu X
+
l tp thuc tnh X
+
= { A

e U | X A e F
+
}
trong LQH:
+
ta xut pht t
thuc tnh no cho X.
Algorithm Closure
Format: C = X

+

- Tp thuc tnh X _ U
Output: - Y = X

+
= { A e U | X A e F
+
}
Method
Y:=X;
repeat
Z:=Y;
if L _ Y then
Y:=Y R;
endif;
endfor;
until Y=Z;
return Y;
end Closure;
ABCDE v tp PTH F = { DE A, B C, E AD }.
a) Tm mt kho ca l-c p. L-c p c kho
K=BE, v (BE)
+
=U v B
+
= BC = U ; E
+
= ADE = U.
b) Tp BCE c phi l kho ca p khng? V sao?
Nguyn Xun
_________________________________________________________________
___

141
Khng, v BCE cha BE, m BE l kho.
c) Tp AD c phi l kho ca p khng? V sao?
Khng, v (AD)
+
= AD = U.
Ta tm tp M l giao ca ton b cc kho ca p:
( )
L R F
M U R L
e
=

M = ABCDE - ACD = BE = K do LQH p ch c mt
kho duy nht.
e) Tnh Z = (X
+
Y)
+
(K
+
- Y) bit X = DE, Y =
AD, K l mt siu kho ca p.
Nhn xt: V K l siu kho ca p nn K
+
= U. Mt
khc, theo cng thc (X
+
Y)
+
= (X Y)
+
nn ta c
Z = (X Y)
+
(U - Y) = (DEA)
+
BCE = DEA BCE =
E.
Thm, chng hn PTH C B. Khi ngoi kho BE
l-c c thm kho CE, v C B. D thy c
th tch LQH p thnh 2 LQH thnh phn c lp
nhau l p
1
=(ADE, { DE A, E AD }) vi kho
K
1
= E v p
2
=(BC, { B C }) vi kho K
2
= B. Khi
thm PTH C B cho LQH p
2
ta c thm kho K
3

= C. Hp nht 2 l-c ny li ta s -c ng 2
kho l
K
1
K
2
= EB v K
1
K
3
= EC.
______________
Nguyn Xun
_________________________________________________________________
___

142
bi gii
Mn: C s d liu, s 2


Cu 1.
a) nh ngha php ton kt ni t nhin hai quan
h: Php kt ni (t nhin) hai quan h R(U) v
S(V), k hiu R-S, cho ta quan h cha cc b -c
dn t cc b u ca quan h R vi mi b v ca quan
h S sao cho cc tr trn min thuc tnh chung
(nu c) ca hai b ny ging nhau.
P(UV) = R-S = { u-v | u e R, ve S, u.M = v.M, M = U
V }
b) Thut ton xc nh php ton kt ni t
nhin hai quan h:
Algorithm Join
Format: P = R-S
- Quan h S(V)
Output: - Quan h
R-S={u-v|ueR,veS,u.M=v.M,M=Uv}
Method
X = Attr(R) Attr(S);
M = Attr(R) Attr(S);
Create(P,X);
for each tuple v in S do
Nguyn Xun
_________________________________________________________________
___

143
if u.M=v.M then
add u-v to P ;
endif;
endfor;
endfor;
return P;
end Join;

Cu 2.
a) nh ngha LQH: L-c quan h (LQH) l mt
cp p = (U,F), trong U l tp hu hn cc
b) nh ngha kho ca l-c quan h: Cho
LQH p = (U,F). Kha ca LQH l tp con thuc tnh
K ca U tha
(i) K
+
= U
(ii) A e K: (K-{A})
+
= U.
c) Thut ton tm mt kho ca l-c quan h:
+
= U.
Algorithm Key
Format: Key(U,F)
- Tp PTH F
- K
+
=U
- A e K: (K-{A})
+
= U
Method
K:=U;
if (K-{A})
+
= U then
K := K-{A}
endif;
endfor;
return K;
end Key;
Nguyn Xun
_________________________________________________________________
___

144
ABCDE v tp PTH F = { EA B, C D, A BE }.
a) Tm mt kho ca l-c p:
( )
L R F
M U R L
e
=
M = ABCDE - BDE = AC, v (AC)
+
=U nn p c
mt kho duy nht l M = AC.
b) Tp CDA c phi l kho ca p khng? V sao?
Khng, v CDA cha kho AC.
c) Tp BE c phi l kho ca p khng? V sao?
Khng, v p ch c mt kho duy nht l AC.
LQH p ch c mt kho duy nht M=AC.
e) Tnh Z = (X
+
Y)
+
K
+
bit X = AE, Y = BE, K
l mt kho ca p.
Nhn xt: V K l kho ca p nn K
+
= U. Mt
+
Y)
+
= (X Y)
+
nn ta c
Z = (X Y)
+
U = (XY)
+
= (ABE)
+
= ABE.
Thm, chng hn PTH D C Khi ngoi kho AC
l-c c thm kho AD, v D C. D thy c
th tch LQH p thnh 2 LQH thnh phn c lp
nhau l p
1
=(ABE, { EA B, A BE }) vi kho
K
1
= A v p
2
=(CD, { C D }) vi kho K
2
= C. Khi
thm PTH D C cho LQH p
2
ta c thm kho K
3

= D. Hp nht 2 l-c ny li ta s -c ng 2
kho l
K
1
K
2
= AC v K
1
K
3
= AD.
____________________

Nguyn Xun
_________________________________________________________________
___

145
bi gii
Mn: C s d liu, s 3


Cu 1.
a) nh ngha php ton ly giao hai quan h:
Php giao (theo l thuyt tp hp hoc ly phn
chung) hai quan h t-ng thch R(U) v S(U), k
hiu R&S, cho ta quan h cha cc b xut hin
ng thi trong c hai quan h thnh phn,
P(U) = R&S = { t | t e R, t e S }
b) Thut ton giao hai quan h:
Algorithm Intersection
Format: P = R&S
- Quan h S(U)
Output: - Quan h R&S={t|teR . teS}
Method
Create(P,Attr(R));
with u in S do
add u to P;
endfor;
return P;
end Intersection;

Cu 2.
a) nh ngha bao ng ca tp thuc tnh
trong LQH: Cho LQH p = (U,F), trong U l tp
Nguyn Xun
_________________________________________________________________
___

146
thuc tnh, F l tp PTH trn U. Bao ng ca tp
thuc tnh X, k hiu X
+
l tp thuc tnh X
+
= { A

e U | X A e F
+
}
trong LQH:
+
ta xut pht t
thuc tnh no cho X.
Algorithm Closure
Format: C = X

+

- Tp thuc tnh X _ U
Output: - Y = X

+
= { A e U | X A e F
+
}
Method
Y:=X;
repeat
Z:=Y;
if L _ Y then
Y:=Y R;
endif;
endfor;
until Y=Z;
return Y;
end Closure;

ABCDE v tp PTH F = { AB C, D E, B CA }.
( )
L R F
M U R L
e
=
Nguyn Xun
_________________________________________________________________
___

147
M = ABCDE - CAE = BD, v (BD)
+
=U nn p c
mt kho duy nht l M = BD.
b) Tp DEB c phi l kho ca p khng? V sao?
Khng, v DEB cha thc s kho M.
c) Tp CA c phi l kho ca p khng? V sao?
Khng v p ch c mt kho duy nht M = BD.
Khng, vi l do trn.
e) Tnh Z = (X
+
Y)
+
K
+
bit X = AB, Y = CA, K l
mt siu kho ca p.
Nhn xt: V K l kho ca p nn K
+
= U. Mt
+
Y)
+
= (X Y)
+
nn ta
c
Z = (X Y)
+
U = (XY)
+
= (ABC)
+
= ABC.
Thm, chng hn PTH E D Khi ngoi kho
BD l-c c thm kho BE, v E D. D thy
c th tch LQH p thnh 2 LQH thnh phn c
lp nhau l p
1
=(ABC, { AB C, B CA }) vi
kho K
1
= B v p
2
=(DE, { D E }) vi kho K
2
=
D. Khi thm PTH E D cho LQH p
2
ta c
thm kho K
3
= E. Hp nht 2 l-c ny li ta
s -c ng 2 kho l
K
1
K
2
= BD v K
1
K
3
= BE.
_______________________________

30.06.2003

Co So Du Lieu

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Co So Du Lieu

Uploaded by

Copyright:

Available Formats

mc lc

You might also like