99

Chng VI
C S D LIU PHN TN
Chng ny cp n cc khi nim c bn v h c s d liu phn tn, h
qun tr c s d liu phn tn v bi ton thit k c s d liu phn tn. Bi ton
thit k c s d liu phn tn rt phc tp v do trng tm ca gio trnh ny trnh
by kin thc v h c s d liu quan h nn cc phng php thit k phn tn
khng c trnh by chi tit cho n cc gii thut m ch yu l nu vn . Mt
khc y l h c s d liu phn tn da trn m hnh quan h nn trc khi thit k
phn tn cc c s d liu phi c thit k theo chun ca h c s d liu quan h
tp trung.
I. CC KHI NIM V H C S D LIU PHN TN.
H c s d liu phn tn (Distributed DataBase System) c xy dng da
trn hai cng ngh c bn l c s d liu v mng my tnh. H c s d liu phn
tn c m t nh l tp hp nhiu c s d liu c lin quan logic n nhau v c
phn b trn mng my tnh.
Trong khi nim c m t v c s d liu phn tn trn c hai c trng
c bn l lin quan logic v phn b trn mng. Trong c s d liu phn tn cc
tp tin d liu c lu tr c lp trn cc nt ca mng my tnh v phi c lin
quan n nhau v mt logic v cn hn th na cn i hi chng phi c truy xut
n qua mt giao din chung, thng nht.
Hin nay khi nim x l phn tn (Distributed procesing), tnh ton phn tn
(Distributed computing) hoc cc thut ng c t phn tn hay c dng ch
cc h thng ri rc nh cc h thng my tnh c a b x l (multiprocessor system)
hay l cc x l trn mng my tnh. C s d liu phn tn l mt khi nim khng
bao gm cc trng hp x l d liu trong cc h thng s dng b nh chung, k c
b nh trong hay b nh th cp (a t), nht thit phi l mt h c s dng giao tip
mng vi cc trm lm vic c lp.
H Qun tr c s d liu phn tn (Distributed DBMS) l h thng phn mm
cho php qun l cc h c s d liu phn tn v lm cho s phn tn tr nn trong
sut i vi ngi s dng.
Khi nim trong sut transparent ch s tch bit cp cao ca h
thng vi cc vn ci t cp thp ca h thng. C cc dng trong sut nh
sau:
CPU CPU
Memory
CPU
Memory
CPU
Memory

DISK
Trm
Trm
Trm
Mi trng mng
Trm
Trm
Hnh 6.1. Cc m hnh khng phi H CSDL phn tn
Trm
Trm
Trm
Trm
Mi trng mng
Trm
Hnh 6.2. M hnh h CSDL phn tn
+ Trong sut v phn tn. Do tnh cht phn tn ca h thng nn cc d liu
c lu tr ti cc nt c v tr a l khc nhau, phn mm s p ng cc yu cu
100
ca ngi s dng sao cho ngi s dng khng cn phi bit v tr a l ca d liu.
+ Trong sut v phn hoch (Partition). Do d liu phn tn v do nhu cu
ca cng vic d liu cn c phn hoch v mi phn hoch c lu tr ti mt
nt khc nhau (y gi l qu trnh phn mnh fragmentation). Qu trnh phn mnh
hon ton t ng bi h thng v ngi s dng khng cn phi can thip.
+ Trong sut v nhn bn (Replication). V l do hiu nng, tin cy nn
d liu cn c sao chp mt phn nhng v tr khc nhau.
+ Trong sut v c lp d liu.
+ Trong sut v kt ni mng. Ngi s dng khng cn bit v s c mt
ca giao tip mng.

Phn tn
Phn mnh
Nhn bn
Kt ni mng
c lp d liu
D liu


Hnh 6.3. Cc tng trong sut ca h thng.
V d 6.1: Mt cng ty c cc vn phng Paris, London, NewYork, Toronto.
Cng ty ny c cc c s d liu sau y:
C s d liu v nhn vin: EMP (ENo, EName, Title)
C s d liu v cc d n: PROJ (PNo, PName, Budget, Loc)
C s d liu v lng: PAY (Title, Sal)
C s d liu v phn cng: ASG (ENo, PNo, Dur, Resp)
Gii thch v cc thuc tnh: Sal: Lng; Title: Chc v; Budget: Ngn sch
ca d n; Loc: a im; Dur: Duration Thi hn; Resp: Responsibility Trch
nhim
101
Do tnh phn tn ca cc vn phng nn ti mi vn phng c lu tr d liu
tc nghip ca chnh cc vn phng , c th l cc nhn vin ti v cc d n m
vn phng ang qun l. Ta c s lu tr phn tn v phn mnh gi nh
nh sau:
London
Emp London
Emp Paris
Proj London
Emp London
Emp Paris
Proj London
Paris
Emp London
Emp Paris
Proj London
Proj Paris
Paris
Emp o
Proj To
Toront
ronto
NewYork
Hnh 6.4. S lu tr phn tn

II. M HNH KIN TRC CA H QUN TR C S D LIU PHN TN.
Trong cc m hnh kin trc ca h QTCSDL phn tn c trnh by trong cc
ti liu kinh in ta xt 3 m hnh ph bin.
1.1. M hnh kin trc ca h phn tn khch/i l client/server.
c trng ca h ny l chc nng ca h thng c chia lm hai lp:
+ Chc nng i l server function
+ Chc nng khch hng client function.
Trong h thng khch/i l cc thao tc x l d liu p ng yu cu ca
khch hng u c thc hin bi cc chc nng i l, ch c kt qu c gi tr
cho khch hng. Ta c m hnh chc nng nh s hnh 7.5.
H khch c cc tng:
+ Giao din tng tc vi ngi s dng (User Interface), cc chng
trnh ng dng (Application Program), ...
+ H qun tr c s d liu khch hng (Client DBMS).
+ Cc phn mm mng c chc nng truyn tin (Communication
Software).
H i l c cc tng:
+ Cc phn mm mng c chc nng truyn tin.
+ Tng kim sot ng ngha ca d liu (Semantic Data Controler).
102
+ Tng ti u ha cu hi (Query Optimizer).
+ Tng qun l cc giao tc (Transaction Manager).
+ Tng qun l khi phc (Recovery Manager).
+ Tng h tr thc thi (Run time Support Processor) .
+ H iu hnh qun l chung v giao tip vi c s d liu vt l.

H

u

h

n
h

User Interface Application Program . . .
Client DBMS
O
p
e
r
a
t
i
n
g

s
y
s
t
e
m

Communication Software

Client


Communication Software
Semantic Data Controler
Query Optimizer
Transaction Manager
Recovery Manager
Run time Support Processor
O
p
e
r
a
t
i
n
g

s
y
s
t
e
m


Yu cu SQL Kt qu




Server






DataBase




Hnh 6.5. S h phn tn client/server

H client/server c u im l x l d liu tp trung, trn ng truyn ch c
cc gi tin yu cu (cu hi) v cc kt qu p ng cu hi, gim ti c khi lng
103
truyn tin trn mng kt hp vi thit b ti i l rt mnh s tng tc x l d liu
ca c h thng.
1.2. M hnh h phn tn ngang hng.
Semantic Data
Controler
User Interface Handler
Global Query
Optimizer
Global Execution
Monitor
External Schema
Global Conceptual
Schema
Local Query Processor
Local Recovery
Manager
Run-Time Support
Processor
Local Conceptual
Schema
System Logic
Local Internal Schema
DataBase
User
Processor
Data
Processor
User
Requets
System
responses
User
























Hnh 6.6. S kin trc ca h phn tn ngang hng

104
105
c im ni bt ca h thng ny l d liu c t chc cc nt c chc
nng nh nhau, ng thi s t chc d liu cc nt ny li c th rt khc nhau, t
cn phi c:
+ nh ngha d liu ti mi v tr: ti mi nt phi xy dng lc d liu
cc b LIS (Local Internal Schema)
+ M t cu trc logic ton cc: Lc khi nim ton cc GCS (Global
Conceptual Schema).
+ M t cu trc logic ti mi v tr, iu ny xy ra do nhn bn v phn mnh,
gi l lc khi nim cc b LCS (Local Conceptual Schema).
+ M t cu trc du liu ca cc ng dng gi l lc ngoi gii ES
(External Schema).
Cu trc ca h thng bao gm hai thnh phn chnh: B phn tip nhn ngi
dng (User Processor) v b phn x l d liu (Data Processor). Hai modun ny
c t chung trn mi my ch khng tch bit nh h thng khch/i l.
Cc chc nng c bn ca tng modun nh sau:
+ User Interface Handler - Giao tip ngi s dng: Din dch yu cu, nh
dng kt qu.
+ Semantic Data Controler - Kim sot d liu ng ngha: Da vo lc
khi nim ton cc kim tra cu vn tin c thc hin c hay khng.
+ Global Query Optimizer - Ti u ha cu hi ton cc: nh ra chin lc
thc thi tt nht trn cc nt.
+ Global Execution Monitor iu khin thc thi cu vn tin ton cc.
+ Local Query Processor X l cu hi cc b
+ Local Recovery Manager Qun l khi phc cc b: Qun l s nht qun
khi c s c.
+ Run-Time Support Processor - B phn h tr thc thi: Qun l truy xut c
s d liu.
1.2. M hnh h phn tn phc hp.
S khc bit c bn so vi h phn tn ngang hng l ch phc h khng c
(hoc c khng y ) mt lc khi nim ton cc.



Query Processor
Recovery Manager
Run-Time Support
Processor
DataBase
User Requets System responses
Transaction Manager
Scheduler
. . .
Query Processor
Recovery Manager
Run-Time Support
Processor
DataBase
Transaction Manager
Scheduler
Multi DBMS Layer
User















Hnh 6.7. S kin trc ca h phn tn phc hp

Trong 3 m hnh nu trn th m hnh khch/i l ang c pht trin v
chng t cc u im ca n v tnh n gin v hu hiu trn mng.
II. THIT K C S D LIU PHN TN.
Mt c s d liu phn tn da trn m hnh quan h trc ht phi tun th
cc quy tc v chun ha cho c s d liu quan h. phn tn c s d liu c hai
hot ng chnh l: Phn mnh cc quan h v Phn tn cc quan h (cp pht cc
mnh).
2.1. Cc kiu phn mnh.
Trong phn ny ta ang xt h cc s d liu phn tn da trn cc lc
quan h, tc l cc bng, nh vy s phn mnh chnh l l hot ng chia mt bng
thnh cc bng nh hn. phn tch s phn mnh ta ly cc quan h EMP, PROJ,
PAY, ASG m t phn trn.
106
107
EMP ASG
ENo EName Title ENo PNo Resp Dur
E1 John Ks. in E1 P1 Qun l 12 (thng)
E2 Mary Ks. H thng E2 P1 Phn tch HT 24
E3 Bill Ks. C kh E2 P2 Phn tch HT 6
E4 Bush Ks. Lp trnh E3 P3 T vn 10
E5 Blair Ks. H thng E3 P4 K thut 48
E6 Tom Ks. in E4 P2 Lp trnh 18
E7 Algor Ks. C kh E5 P2 Qun l 24
E8 David Ks. in E6 P4 Qun l 48
E7 P3 K thut 36
E8 P3 Qun l 40

PROJ PAY
PNo PName Budget Loc Title Sal
P1 Thit b 150000 Toronto Ks. in 4000
P2 CSDL 125000 NewYork Ks. H thng 7000
P3 Games 75000 NewYork Ks. C kh 3500
P4 CAD 100000 Paris Ks. Lp trnh 2000

2.1.1. Phn mnh ngang.
Gi s ta c mt yu cu phn mnh quan h PROJ thnh hai bng PROJ1 v
PROJ2 sao cho mt bng cha cc d n c ngn sch ln hn 100000 v ci kia cha
cc d n c ngn sch nh hn 100000.
PROJ1
PNo PName Budget Loc
P1 Thit b 150000 Toronto
P2 CSDL 125000 NewYork

PROJ2
PNo PName Budget Loc
P3 Games 75000 NewYork
P4 CAD 100000 Paris
2.1.2. Phn mnh dc
Cng quan h PROJ ta phn mnh thnh hai bng PROJ3 v PROJ4, kha ca
quan h PNo c mt c hai bng con.
PROJ3 PROJ4
PNo PName Loc PNo Budget
P1 Thit b Toronto P1 150000
P2 CSDL NewYork P2 125000
P3 Games NewYork P3 75000
P4 CAD Paris P4 100000

Trong thc t s phn mnh s xy ra vic kt hp c hai loi phn mnh v ta
gi l s phn mnh hn hp. Mc phn mnh ty theo yu cu ca ng dng, phn
mnh qu ln hay qu nh u gy ra cc hiu ng ph kh kim sot.
2.1.3. Cc quy tc phn mnh.
Cc quy tc ny nhm m bo tnh nht qun ca c s d liu, c bit v
ng ngha ca d liu.
q1. Tnh y .
Nu mt quan h R c phn mnh thnh cc mnh con R
1
, R
2
, ..., R
n
th mi
mc d liu phi nm trong mt hoc nhiu cc mnh con. y trong phn ngang
th mc d liu c hiu l cc b cn trong phn mnh dc l cc thuc tnh. Quy
tc ny m bo khng b mt d liu khi phn mnh.
q2. Tnh ti thit c.
Nu mt quan h R c phn mnh thnh cc mnh con R
1
, R
2
, ..., R
n
th phi
nh ngha c mt ton t quan h sao cho R = R

=
n
i 1
i

q3. Tnh tch bit.
Gi s mt quan h R c phn mnh thnh cc mnh con R
1
, R
2
, ..., R
n
.
i vi phn mnh ngang mc d
i
nm trong mnh R
j
th n s khng nm
trong mnh R
k
vi kj.
i vi phn mnh dc th kha chnh phi c lp li trong cc mnh con,
cn cc thuc tnh khc phi tch ri.
2.2. Phng php phn mnh ngang.
2.2.1. Cc yu cu v thng tin.
108
phc v cho cc hot ng phn mnh ta cn c cc loi thng tin sau y:
a1) Thng tin v c s d liu.
y l thng tin v lc d liu ton cc, ch ra cc mi lin kt gia cc
quan h. Ta m hnh ha s lin kt ny bng mt th c hng, cc cung ch mt
lin h kt ni bng, mi nt l mt lc quan h. Quan h u ng ni gi l
quan h ch nhn (Owner) cn quan h cui ng ni gi l quan h thnh vin
(Member). ta nh ngha hai hm Owner v Member t tp cc ng ni n tp cc
quan h.
V d 6.2:
PAY
Title Sal

EMP PROJ
ENo EName Title PNo PName Budget Loc Dur
109


ASG
ENo PNo Resp Dur
L3
L2
L1

Ta c cc hm Owner v Member xc nh nh sau:
Owner (L1) = PAY, Member (L1) = EMP
Owner (L2) = EMP, Member (L2) = ASG
Owner (L3) = PROJ, Member (L3) = ASG
a2) Thng tin v ng dng.
Thng tin v ng dng c hai loi: Thng tin nh tnh dng phn mnh v
thng tin nh lng dng cp pht.
Thng tin nh tnh v c bn l cc v t dng trong cu vn tin, cc v t ny
c xy dng da trn s phn tch cc ng dng.
nh ngha v t n gin: Cho lc R = (A
1
, A
2
, ..., A
n
) vi thuc tnh A
i
c
min xc nh D
i
ta c v t n gin
p: A
i
Value {<, , =, , >, } v Value D
i
Tp P
Ri
cha cc v t n gin trn quan h R
i
. V d vi quan h PROJ trn
ta c tp v t n gin sau: P
PROJ
= { PName = Xy dng, Budget 100000 }
nh ngha v t hi s cp: Cho tp P
Ri
= {p
i1
, p
i2
, ..., p
im
} cha cc v t n
gin trn R
i
. Ta nh ngha tp cc v t hi s cp M
i
= {m
i1
, m
i2
, ..., m
it
} nh sau:
110
*
m
ij
=
p
ik
P
p
Ri
ik

trong p
*
ik
l p
ik
hoc p
ik
.
y v l do phc tp nn ta ch xt n cc ph nh ca v t ng thc n
gin.
V d 6.3: Ta xt quan h PAY c cc v t n gin.
p
1
: Title = Ks. in
p
2
: Title = Ks. H thng
p
3
: Title = Ks. C kh
p
4
: Title = Ks. Lp trnh
p
5
: Sal 3500
p
6
: Sal > 3500
t ta xy dng c cc v t hi s cp nh sau:
m
1
: Title = Ks. in Sal 3500
m
2
: Title = Ks. in Sal > 3500
m
3
: (Title = Ks. in) Sal 3500
m
4
: (Title = Ks. in) Sal > 3500
. . .
Tt nhin cc v t n gin cng c coi l mt b phn ca cc v t hi s
cp v thc ra m
3
v m
4
c th vit bng cch s dng mt v t tng ng, chng
hn: Title Ks. in Sal 3500. Nu ta c xy dng v t hi mt cch my mc
th c mt s trng hp c th v ngha i vi quan h.
Cc thng tin c lin quan n v t hi s cp l tuyn hi s cp v tn s
truy xut. tuyn hi s cp o s lng cc b ca quan h c truy xut bi cu
vn tin s dng v t hi s cp . Tn s truy xut ch tn s cc ng dng truy
xut d liu c s dng cu vn tin s dng v t hi s cp.
2.2.2. Phn mnh ngang nguyn thy.
111
Phn mnh ngang nguyn thy l mt php chn trn quan h ch ca mt lc
R.
R
i
=
Fi
(R) i = 1, ..., t
y F
i
l mt cng thc chn s dng mt v t hi s cp m
i
.
V d 6.4: Ta c th phn r quan h PROJ thnh PROJ1 v PROJ2 s dng cc
v t c bn Budget 100000 v Budget > 100000
PROJ1 =
Budget 100000
(PROJ)
PROJ2 =
Budget > 100000
(PROJ)
Mt vn phc tp l tp cc v t hi s cp dng phn mnh c th thay
i khi cc ng dng hot ng, s gp rt nhiu kh khn khi min xc nh ca
thuc tnh l v hn v lin tc. Chng hn khi thm mt b mi vo PROJ c budget
l 500000 lc ta phi xem xt l t n vo PROJ2 hay phi xy dng thm PROJ3
v hn ch PROJ2.
PROJ2 =
100000<Budget 400000
(PROJ)
PROJ3 =
Budget > 400000
(PROJ)
V d 6.5: Ta phn mnh PROJ da vo v tr ca d n.
PROJ1 =
Loc = Toronto
(PROJ)
PROJ2 =
Loc = NewYork
(PROJ)
PROJ3 =
Loc = Paris
(PROJ)
Nh vy t tp M
i
cc v t hi s cp ta c tp mnh ngang tng ng R
i
i=1..t
c xy dng trn php chn s dng m
i
, ta gi tp {R
i
} l tp cc mnh hi s cp.
S cc mnh ngang ph thuc vo tp v t hi s cp, nh vy phn mnh cn xc
nh tp cc v t n gin s to ra cc v t hi s cp. Mt tp v t n gin s phi
l mt tp v t c tnh y v cc tiu. Tnh y c hiu l xc sut mi ng
dng truy xut n mt b no trong mt mnh hi s cp no c sinh ra nh
tp v t n gin u bng nhau. Tnh cc tiu c hiu l mt v t l tha nu
khng c ng dng no truy xut n mnh do n sinh ra.
V d 6.6: Vi v d 6.5 ta xc nh tp cc P
PROJ
= {Loc = Toronto, Loc =
NewYork, Loc = Paris}.
Nu truy xut theo v tr th P
PROJ
l y
Nu c thm ng dng truy cc b theo Budget 100000 th P
PROJ
khng
y . Trong trng hp ta phi b xung cho P
PROJ
tr thnh y
112
v lc ny th ta c P
PROJ
= {Loc = Toronto, Loc = NewYork, Loc
= Paris, Budget 100000, Budget >100000}
V d 6.7: Xt PROJ c cc ng dng truy xut theo v tr v ngn sch nh
trong v d 6.6
Tp P
PROJ
nh v d 6.6 l n gin v cc tiu.
Nu b xung thm v t n gin PName = Xy dng vo P
PROJ
th lm
cho tp v t ny khng cc tiu v khng c ng dng no truy xut n
mnh do n sinh ra.
Khi mt tp v t l cc tiu th tt c cc v t trong u sinh ra phn mnh
c truy xut bi t nht mt ng dng, ta gi nhng v t l c lin i.
Bc 1: Thut ton tm tp v t y v cc tiu.
Quy tc c bn v DD&CT: Mt quan h hoc mt mnh c phn hoch
thnh t nht hai phn v chng c truy xut khc nhau bi t nht mt ng dng.
Ta gi f
i
ca P
R
l mnh f
i
c sinh ra t mt v t hi s cp trong P
R
.
Thut ton COM_MIN
u vo R l quan h; P
R
l tp v t n gin.
u ra P
R
l tp v t n gin v cc tiu.
Begin
Tm mt v t p
i
P
R
sao cho p
i
phn hoch R theo quy tc c bn
DD&CT;
P
R
= {p
i
};
P
R
= P
R
{p
i
};
F = {f
i
} /* f
i
l mnh hi s cp sinh ra bi p
i
*/
Do
Begin
Tm mt p
j
P
R
sao cho p
j
phn hoch mt mnh f
k
ca P
R

theo quy tc c bn DD&CT ;
P
R
= P
R
{p
j
} ;
P
R
= P
R
{p
j
} ;
F = F{f
j
} ; /* f
j
sinh ra bi p
j
*/
113
If p
k
P
R
l mt v t khng c lin i then
Begin
P
R
= P
R
-{p
k
} ;
F = F-{f
k
}
End ;
End ;
Until P
R
l y
End.
Bc 2 : Tnh tp v t hi s cp t tp y v cc tiu.
Vic tnh ton ny rt d nhng hay dn n nhng tp v t hi s cp rt ln
do vic tnh my mc. Vic gin c tp v t hi s cp c thc hin bc th 3.
Bc 3 : Loi b nhng v t hi s cp v ngha.
Vic ny u tin phi xc nh nhng v t mu thun vi tp cc php ko
theo. V d , P
R
= {p
1
, p
2
} vi Att l thuc tnh v {V
1
, V
2
} l min thuc tnh ca Att
ta c th gi thit :
p
1
: Att = V
1
v p
2
: Att = V
2
Vy ta c cc php ko theo
(Att = V
1
) (Att = V
2
)
(Att = V
1
) (Att = V
2
)
Ta c cc v t hi s cp c tnh theo quy tc:
m
1
: (Att = V
1
) (Att = V
2
)
m
2
: (Att = V
1
) (Att = V
2
)
m
3
: (Att = V
1
) (Att = V
2
)
m
4
: (Att = V
1
) (Att = V
2
)
Cc v t m
1
v m
4
mu thun vi cc php ko theo chng ta xc nh trn
v v th chng ta s loi n ra khi P
R
.
Bc 4: Thut ton tm tp v t hi s cp c ngha.
Thut ton PHORIZONTAL
u vo R l mt quan h
u ra M l tp cc v t hi s cp c ngha.
114
Begin
P
R
= COM_MIN (R, P
R
) ;
Tnh tp M cc v t hi s cp t P
R
;
Tnh tp cc I cc php ko theo gia cc p
i
P
R
;
For mi m
i
M Do
If m
i
mu thun vi I then M = M {m
i
}
End.
V d 6.8 : Gi s c quan h PAY v PROJ phi phn mnh ngang nguyn
thy
Gi s ch c mt ng dng truy xut PAY, mu tin nhn vin c lu tr ti
hai ni. Mt ni qun l thng tin ca cc nhn vin c lng cao hn 3500 v ni kia
l cc nhn vin c lng t 3500 tr xung. V vy cu vn tin ca ng dng s c
truy xut c hai ni. Tp v t n gin dng phn hoch PAY :
p
1
: Sal 3500
p
2
: Sal > 3500
T ta c tp v t n gin khi u l P
R
= {p
1
, p
2
}. p dng thut ton
COM_MIN vi khi u i=1 ta c P
R
= {p
1
}. y chnh l tp y v cc tiu v p
2

khng phn hoch f
1
l mnh hi s cp c sinh ra t p
1
. Vy chng ta c cc v t
hi s cp sau :
m
1
: Sal 3500
m
2
: (Sal 3500) tng ng vi (Sal > 3500)
Cui cng chng ta c cc mnh ngang nguyn thy ca PAY c phn hoch
theo m
1
v m
2
:
PAY2 PAY1
Title Sal Title Sal
Ks. in 4000 Ks. C kh 3500
Ks. H thng 7000 Ks. Lp trnh 2000
Gi s c hai ng dng truy xut n PROJ. Mt ng dng truy xut theo v tr,
chng hn ta c cu truy vn:
Select PName, Budget
From PROJ
Where Loc = Value
115
T ta c:
P
PROJ
= { p
1
: Loc = Toronto; p
2
: Loc = New York; p
3
: Loc = Paris}
Mt ng dng khc truy xut theo ngn sch, ta thm vo cc v t:
p
4
: Budget 100000 v p
5
: Budget > 100000
Cui cng ta c tp cc v t n gin l:
P
PROJ
= { p
1
: Loc = Toronto; p
2
: Loc = New York; p
3
: Loc = Paris; p
4
:
Budget 100000; p
5
: Budget > 100000}
Thc hin thut ton COM_MIN vi P
PROJ
ta thy tp P
PROJ
l y v cc
tiu.
Xy dng tp v t hi s cp M:
m
1
: Loc = Toronto Budget 100000
m
2
: Loc = Toronto Budget > 100000
m
3
: Loc = New York Budget 100000
m
4
: Loc = New York Budget > 100000
m
5
: Loc = Paris Budget 100000
m
6
: Loc = Paris Budget > 100000
m7: p
1
p
2
p
3
p
4
p
5
. . .
Cc php ko theo hin nhin:
i
1
: p
1
p
2
p
3
i
5
: p
5
p
4
i
2
: p
2
p
1
p
3
i
6
: p
4
p
5
i
3
: p
3
p
1
p
2
i
7
: p
5
p
4
i
4
: p
4
p
5
Xt trong tp M ch c cc v t hi cha hai v t n gin l khng xy ra
mu thun vi cc php ko theo, v vy chng ta loi b ht cc v t hi ch gi li
cc v t . Nh vy chng ta c tp v t hi s cp cui cng l:
M = {m
1
, m
2
, m
3
, m
4
, m
5
, m
6
}


116
Phn mnh ngang nguyn thy quan h PROJ theo M (lu l PROJ1 v
PROJ6 l rng) chng ta c:
PROJ2 PROJ3
PNo PName Budget Loc PNo PName Budget Loc
P1 Thit b 150000 Toronto P2 CSDL 125000 NewYork

PROJ4 PROJ5
PNo PName Budget Loc PNo PName Budget Loc
P3 Games 75000 NewYork P4 CAD 100000 Paris

2.2.3. Phn mnh ngang dn xut.
Phn mnh ngang dn xut c nh ngha da trn mt s phn mnh ngang
mt quan h thnh vin ca mt ng ni da theo php ton chn trn quan h ch
nhn ca ng ni , hay ta cn gi l s phn mnh quan h thnh vin da trn
c s phn mnh quan h ch nhn.
Cho trc mt ng ni L, ta c: Owner (L) = S v Member (L) = R. nh
ngha cc mnh ngang dn xut ca R nh sau:
R
i
= R S
i
vi i=1..s
trong s l s lng cc mnh ngang trn R, S
i
=
Fi
(S) l mnh ngang nguyn thy
c xy dng t v t hi s cp F
i
, l php lin kt bng trn kha kt ni ca ch
nhn v thnh vin.
V d 6.9: xt s quan h PAY vi EMP c ng kt ni L1, ta nh ngha
php lin kt bng : PAY.Title = EMP.Title.
Trn quan h PAY ta c M
PAY
= { m
1
: Sal 3500; m
2
: Sal >3500} t PAY
c chia thnh cc mnh hi s cp PAY1 v PAY2.
PAY1 =
Sal 3500
(PAY)
PAY2 =
Sal > 3500
(PAY)
Ta c cc mnh ngang dn xut: EMP1 = EMP PAY1
EMP2 = EMP PAY2
EMP1 EMP2
ENo EName Title ENo EName Title
E1 John Ks. in E4 Bush Ks. Lp trnh
E2 Mary Ks. H thng
E3 Bill Ks. C kh
E5 Blair Ks. H thng
E6 Tom Ks. in
E7 Algor Ks. C kh
E8 David Ks. in

S lin kt ca c s d liu sau khi phn mnh:

PAY1
Title Sal
PAY2
Title Sal
EMP1
ENo EName Title
EMP2
ENo EName Title
PROJ
PNo PName Budget
L3 L2
L11 L12







ASG
ENo PNo Resp Dur

Ta c mt s nhn xt quan trng sau y:
+ Thut ton phn mnh dn xut cn c tp cc phn hoch quan h ch nhn -
thnh vin, tp v t lin kt quan h gia ch nhn v thnh vin.
+ Nu mt quan h l thnh vin ca nhiu hn mt ch nhn th vn s tr
nn phc tp hn.
+ Phn mnh dn xut s gy nn phn mnh lan truyn.
2.3. Phng php phn mnh dc.
ngha ca phn mnh dc l to ra cc quan h nh hn sao cho gim ti
a thi gian thc hin ca cc ng dng chy trn mnh . Vic phn mnh dc l
hot ng chia mt quan h R thnh cc mnh con R
1
, R
2
, ..., R
n
sao cho mi mnh
con cha tp con thuc tnh v cha c kha ca R. Vi cch t vn nh vy th
117
118
vic phn mnh dc khng ch l bi ton ca h c s d liu phn tn m cn l bi
ton ca ngay c h c s d liu tp trung.
Phn mnh dc l mt bi ton ht sc phc tp, ngi ta chng minh c
rng nu quan h c m thuc tnh khng phi l thuc tnh kha th s lng cc mnh
dc c phn ra l s Bell th m (k hiu B(m)), s ny tng rt nhanh vi s m ln
v t n m
m
. Chng hn m=10 th B(m)115.000, vi m=15 th B(m)10
9
, vi m=30
th B(m)10
23
. V vy bi ton phn mnh dc phi s dng n cc thut gii
heuristic. C hai phng php chnh c nghin cu l phng php nhm v
phng php tch, trong hai phng php th phng php tch t ra c s ti u hn.
Phng php nhm: Khi u bng tp cc mnh, mi mnh c mt thuc tnh,
ti mi bc ghp mt s mnh li cho n khi tha mn mt tiu chun no .
Phng php tch: Ti mi bc tm mt phn hoch c li cho vic truy xut
ca ng dng trn cc thuc tnh ca n.
Thng tin dng phn mnh dc c lin quan n cc ng dng, mt mnh
dc thng cha cc thuc tnh thng xuyn c truy xut chung bi mt ng dng,
ngi ta tm cch lng ha khi nim ny bng mt s o gi l i lc (affinity i
lc hoc s li cun). S o ny c th tnh c khi ta tnh c tn s truy xut ti
cc thuc tnh ca ng dng. Trn c s khi nim i lc v tnh c s dng
thuc tnh ca cc cu vn tin ca ng dng ngi ta xy dng c gii thut tch
rt hu hiu.
Gi Q = {q
1
, q
2
, . . ., q
t
} l tp cc cu vn tin m ng dng s truy xut trn
quan h R(A
1
, A
2
, . . ., A
n
). Vi mi cu vn tin q
i
v thuc tnh A
j
chng ta s a ra
mt gi tr s dng thuc tnh, k hiu l use (q
i
, A
j
) c nh ngha nh sau:
1 nu A
j
c vn tin q
i
s dng
use (q
i
, A
j
) =
0 trong trng hp ngc li.
cc gi tr use (q
i
, *) rt d xc nh nu chng ta bit c cc ng dng chy trn
CSDL.
V d 6.10: Xt quan h PROJ, gi s cc ng dng s dng cu vn tin SQL
truy xut n n:
q1: Tm ngn sch ca d n theo m s.
SELECT Budget
FROM PROJ
WHERE PNo = V
q2: Tm tn v ngn sch ca tt c cc d n.
SELECT PName, Budget
FROM PROJ
q3: Tm tn ca d n theo v tr.
SELECT PName
FROM PROJ
WHERE Loc = V
q4: Tm tng ngn sch d n ti mi v tr.
SELECT Sum (Budget)
FROM PROJ
WHERE Loc = V
thun tin ta k hiu A
1
= PNo, A
2
= PName; A
3
= Budget; A
4
= Loc. Chng
ta c ma trn sau y
A
1
A
2
A
3
A
4
q
1
1 0 1 0
q
2
0 1 1 0
q
3
0 1 0 1
q
4
0 0 1 1
Ta nhn xt rng gi tr s dng khng cha thng tin v ln ca tn s ng
dng, s o ny nm trong nh ngha v s o i lc thuc tnh aff (A
i
, A
j
)
aff (A
i
, A
j
) =
= = 1 ) , ( 1 ) , ( :
) ( ). (
j k i k l
A q use A q use k S
k l k
q acc q ref

trong ref(q
k
) l s truy xut n cc thuc tnh (A
i
, A
j
) cho mi ng dng ca q
k
ti
v tr S
l
v acc(q
k
) l k hiu s o tn s truy xut ng dng. Kt qu tnh ton c
mt ma trn vung nxn v ta gi n l ma trn i lc thuc tnh AA.
V d 6.11: Tip tc vi v d trn v cho n gin chng ta gi s ref(q
k
) =
1 cho tt c q
k
v S
l
. S o tn s truy xut ng dng gi thit nh sau:
acc
1
(q
1
) = 15 acc
2
(q
1
) = 20 acc
3
(q
1
) = 10
acc
1
(q
2
) = 5 acc
2
(q
2
) = 0 acc
3
(q
2
) = 0
acc
1
(q
3
) = 25 acc
2
(q
3
) = 25 acc
3
(q
3
) = 25
acc
1
(q
4
) = 3 acc
2
(q
4
) = 0 acc
3
(q
4
) = 0
119
Nh vy chng ta tnh s o i lc gia cc thuc tnh A
1
v A
3
v bi v ng
dng duy nht truy xut n c hai thuc tnh ny l q
1
nn ta c:
aff(A
1
, A
3
) = acc
1 3
1 1 k l = =
l
(q
k
) = acc
1
(q
1
) +acc
2
(q
1
) + acc
3
(q
1
) = 45
Ma trn i lc thuc tnh y nh sau:
A
1
A
2
A
3
A
4
A
1
45 0 45 0
AA = A
2
0 80 5 75
A
3
45 5 53 3
A
4
0 75 3 78

Thut ton t nhm.
Mc tiu ca thut ton ny l tm mt phng php no nhm cc thuc
tnh ca mt quan h li da trn cc gi tr i lc thuc tnh trong AA. tng chnh
ca thut ton l t mt ma trn i lc thuc tnh AA sinh ra mt ma trn i lc t CA
da trn cc hon v hng v ct, hon v c thc hin sao cho s o i lc chung
AM l ln nht.
AM = aff(A
1 1
n n
i j = =
i
,A
j
).[aff(A
i
,A
j-1
) + aff(A
i
,A
j+1
) + aff(A
i-1
,A
j
) +aff(A
i+1
,A
j
)]
trong aff(A
0
,A
j
) = aff(A
i
,A
0
) = aff(A
n+1
,A
j
) = aff(A
i
,A
n+1
) = 0 l cc iu kin bin
khi mt thuc tnh c t vo CA vo bn tri ca thuc tnh cn tri hoc v bn
phi ca thuc tnh cn phi trong cc han v ct, tng t cn trn di i vi hon
v hng. V ma trn i lc AA c tnh i xng nn cng thc trn c th thu gn:
AM = aff(A
1 1
n n
i j = =
i
,A
j
).[aff(A
i
,A
j-1
) + aff(A
i
,A
j+1
)]
Chng ta nh ngha cu ni (bond) gia hai thuc tnh A
x
v A
y
l:
bond(A
x
,A
y
) =
1
n
z =

aff(A
z
,A
x
).aff(A
z
,A
y
)

120
da vo nh ngha chng ta c th vit li AM nh sau:
AM = [bond(A
1
n
j =
j
,A
j-1
) + bond(A
j
,A
j+1
)]
By gi chng ta xt dy thuc tnh nh sau:
A
1
... A
i-1
A
i
A
j
A
j+1
... A
n
AM AM
s o i lc chung cho cc thuc tnh ny l:
AM
old
= AM+AM + bond(A
i-1
,A
i
)+bond(A
i
,A
j
)+bond(A
j
,A
i
)+bond(A
j
,A
j+1
)
= AM+AM + bond(A
i-1
,A
i
)+bond(A
j
,A
j+1
)+ 2bond(A
i
,A
j
)
Khi t mt thuc tnh mi A
k
gia cc thuc tnh A
i
v A
j
th s o i lc
chung mi l:
AM
new
= AM+AM + bond(A
i-1
,A
i
)+
bond(A
i
,A
k
)+bond(A
k
,A
i
)+bond(A
k
,A
j
)+bond(A
j
,A
k
)+bond(A
j
,A
j+1
)
= AM+AM + bond(A
i-1
,A
i
)+bond(A
j
,A
j+1
)+
2bond(A
i
,A
k
) + 2bond(A
k
,A
j
)
ng gp thc cho s o i lc chung khi t A
k
gia A
i
v A
j
l:
cont(A
i
,A
k
,A
j
) = AM
new
AM
old
= 2bond(A
i
,A
k
) + 2bond(A
k
,A
j
) - 2bond(A
i
,A
j
)
V d 6.12: Vi ma trn AA c tnh trn, tnh ng gp thc khi chuyn
thuc tnh A
4
vo gia cc thuc tnh A
1
v A
2
:
cont(A
1
,A
4
,A
2
) = 2bond(A
1
,A
4
) + 2bond(A
4
,A
2
) - 2bond(A
1
,A
2
)
Ta c:
bond(A
1
,A
4
) = 45*0 + 0*75 + 45*3 + 0*78 = 135
bond(A
4
,A
2
) = 11865
bond(A
1
,A
2
) = 225
v vy: cont(A
1
,A
4
,A
2
) = 2*135 + 2*11865 2*225 = 23550
Thut ton nng lng ni BEA (Bond Energy Algorithm)
Thut ton nng lng ni c thc hin qua ba bc.
B1. Khi gn. t v c nh mt trong cc ct ca AA vo trong CA. Ct 1
c chn trong thut ton ny.
121
122
B2. Thc hin lp. Ly ln lt mt trong n-i ct cn li (i l s ct t vo
trong CA) v th t chng vo i+1 v tr cn li trong ma trn CA. Ni t c chn
sao cho n ng gp nhiu nht cho s i lc chung c m t trn. Vic lp c
kt thc khi khng cn ct no t
B3. Sp th t hng. Mt khi th t ct c xc nh, cc hng cng cn
c t li cc v tr tng i ca chng ph hp vi cc v tr tng i ca ct
Thut ton BEA
u vo: AA ma trn i lc thuc tnh
u ra: CA ma trn i lc t.
Begin
/* Khi gn */
CA(*,1) := AA(*,1) ;
CA(*,2) := AA(*,2) ;
index := 3 ;
While index <= n Do /*Chn v tr tt nht cho thuc tnh AA
index
*/
Begin
For i :=1 To index -1 Do tnh cont (A
i-1
,A
index
,A
i
);
tnh cont (A
index-1
, A
index
, A
index+1
);
loc := ni t c chn bi gi tr cont ln nht
For j := index DownTo loc Do CA(*,j) := AA(*,j-1);
CA(*,loc) := AA(*,index);
index := index + 1
End
Sp th t cc hng theo th t tng i ca ct.
End.
V d 6.13. Tip tc vi nhng kt qu tnh ton nhng v d trn, chng ta
xem xt qu trnh gom t cc thuc tnh ca quan h PROJ.
Khi u chng ta t ct 1 v 2 ca AA vo ma trn CA. Tip theo chng ta
xt ct 3 (thuc tnh A
3
), c ba cch t m t theo v tr l 3-1-2, 1-3-2 hoc 1-2-3.
Chng ta tnh ng gp cho s o i lc chung ca mi kh nng ny :
123
Th t 0-3-1 :
cont(A
0
,A
3
,A
1
) = 2bond(A
0
,A
3
) + 2bond(A
3
,A
1
) - 2bond(A
0
,A
1
)
chng ta bit rng bond(A
0
,A
1
) = bond(A
0
,A
3
) = 0, v vy:
cont(A
0
,A
3
,A
1
) = 2bond(A
3
,A
1
) = 2(45*48+5*0+53+45+3*0) = 8820
Th t 1-3-2 :
bond(A
1
,A
3
) = bond(A
3
,A
1
) = 4410
bond(A
3
,A
2
) = 890
bond(A
1
,A
2
) = 225
cont(A
1
,A
3
,A
2
) = 2bond(A
1
,A
3
) + 2bond(A
3
,A
2
) - 2bond(A
1
,A
2
) = 10150
Th t 2-3-4 :
bond(A
1
,A
4
) = 890
bond(A
3
,A
4
) = bond(A
2
,A
4
) = 0
cont(A
2
,A
3
,A
4
) = 2bond(A
2
,A
3
) + 2bond(A
3
,A
4
) - 2bond(A
2
,A
4
) = 1780
Trong nhng cch tnh ton trn lu rng ct A
0
v ct A
4
l cc v tr rng
ca ma trn CA trong ng cnh hin ti, khng c nhm ln vi thuc tnh A
4
.Ta
thy th t 1-3-2 c s ng gp ln nht nn v tr ny c chn.
A
1
A
2
A
1
A
3
A
2

A
1
45 0 A
1
45 45 0
A
2
0 80 A
2
0 5 80
A
3
45 5 A
3
45 53 5
A
4
0 75 A
4
0 3 75
(a) (b)

A
1
A
3
A
2
A
4
A
1
A
3
A
2
A
4
A
1
45 45 0 0 A
1
45 45 0 0
A
2
0 5 80 75 A
3
45 53 5 3
A
3
45 53 5 3 A
2
0 5 80 75
A
4
0 3 75 78 A
4
0 3 75 78
(c) (d)
Trong bng (d) trn ta thy ma trn c hai t, gc trn tri bao gm cc gi tr
i lc nh, gc di phi c cc gi tr i lc ln, tuy nhin trn thc t s tch bit
ny khng hon ton r rng. Nu ma trn CA ln ta s thy c nhiu t hn v vy s
dn n c nhiu phn hoch la chn hn.
Thut ton phn hoch thuc tnh.
Xt ma trn t, mt im nm trn ng cho s xc nh hai tp thuc tnh.
Gi s im nm ct i th cc tp l {A
1
, . . ., A
i
} v {A
i+1
, . . ., A
n
}, ta gi l
tp nh (top) TA v tp y (bottom) BA.

A
1
A
2
... A
i
A
i+1
... A
n
A
1

A
2
TA
...
A
i

A
i+1

... BA
A
n


Xt tp ng dng Q = {q
1
, q
2
, . . ., q
t
}, ta nh ngha cc tp ng dng ch truy
xut TA, ch truy xut BA hoc c hai. AQ(q
i
) tp thuc tnh c truy xut bi ng
dng q
i
, TQ v BQ l tp ng dng ch truy xut TA v BA, OQ l tp ng dng truy
xut c hai.
AQ(q
i
) = {A
j
use (q
i
,A
j
) = 1} TQ = {q
i
| AQ(q
i
) TA}
BQ = {q
i
| AQ(q
i
) BA} OQ = Q {TQ BQ}
Gi s c n thuc tnh th chng ta c n-1 v tr c th chn cho im phn chia.
V tr tt nht chn sao cho tng cc truy xut ch mt mnh l ln nht cn tng
truy xut c hai mnh l nh nht. Chng ta nh ngha phng trnh chi ph nh sau:
CQ =

ref
Q q S
i j
j
(q
i
) . acc
j
(q
i
) CTQ =

TQ q S
i j
ref
j
(q
i
) . acc
j
(q
i
)
CBQ = ref

BQ q S
i j
j
(q
i
) . acc
j
(q
i
) COQ =

OQ q S
i j
ref
j
(q
i
) . acc
j
(q
i
)
124
125
Phng trnh ti u ha xc nh im x (1xn) sao cho:
z = CTQ * CBQ COQ
2
max
chn c x theo phng trnh ti u ha chng ta phi xt tt c n-1 trng
hp. cho n gin chng ta ch xt trng hp im z l duy nht v t nm gc
trn tri v gc di phi ca ma trn CA. im z chia quan h R thnh hai mnh R
1
v R
2
sao cho R
1
R
2
= K (tp thuc tnh kha chnh)
Thut ton PARTITION
u vo: CA ma trn i lc t, R quan h, ref ma trn s dng thuc tnh,
acc ma trn tn s truy xut, K tp thuc tnh kha chnh ca R
u ra: F tp cc mnh dc.
Begin
z l v tr thuc ct th nht;
tnh CTQ
1
;
tnh CBQ
1
;
tnh COQ
1
;
best := CTQ
1
* CBQ
1
COQ
2
1
For i := 2 To n-1 Do
Begin
tnh CTQ
i
;
tnh CBQ
i
;
tnh COQ
i
;
z := CTQ
i
* CBQ
i
COQ
2
i
;
If z > best Then best := z
End;
R
1
:=
TA
(R) K;
R
2
:=
BA
(R) K;
F := R
1
R
2
End.


126
V d 6.14 : Tip tc vi cc tnh ton trn v vi nhng d liu c.
acc
1
(q
1
) = 15 acc
2
(q
1
) = 20 acc
3
(q
1
) = 10
acc
1
(q
2
) = 5 acc
2
(q
2
) = 0 acc
3
(q
2
) = 0
acc
1
(q
3
) = 25 acc
2
(q
3
) = 25 acc
3
(q
3
) = 25
acc
1
(q
4
) = 3 acc
2
(q
4
) = 0 acc
3
(q
4
) = 0

A
1
A
2
A
3
A
4
q
1
1 0 1 0
q
2
0 1 1 0
q
3
0 1 0 1
q
4
0 0 1 1

v tr 1 : TA = {A
1
}, TQ = {}, BQ = {q
2
, q
3
, q
4
}, OQ = {q
1
}
CTQ
1
= 0
CBQ
1
= acc
1
(q
2
) + acc
2
(q
2
) + acc
3
(q
2
) + acc
1
(q
3
) + acc
2
(q
3
) + acc
3
(q
3
) +
acc
1
(q
4
) + acc
2
(q
4
) + acc
3
(q
4
) = 83
COQ
1
= 45
z = - 2025
v tr 2 : TA = {A
1
, A
3
}, TQ = {q
1
}, BQ = {q
3
}, OQ = {q
2
, q
4
}
CTQ
2
= 45
CBQ
2
= 75
COQ
2
= 8
z = 3311
v tr 3 : TA = {A
1
, A
3
, A
2
}, TQ = {q
1
, q
2
}, BQ = {}, OQ = {q
3
, q
4
}
CTQ
3
= 50
CBQ
3
= 0
COQ
3
= 78
z = - 6084
Ta chn v tr 3 lm im phn chia v ti v tr ny gi tr chi ph l cao nht. Nh vy
chng ta c PROJ1 = {A
1
, A
3
} v PROJ2 = {A
1
, A
2
, A
4
}. Tc l PROJ1 = {PNo,
Budget} v PROJ2 = {PNo, PName, Loc}
127
2.4. Phn tn ti nguyn
Phn tn ti nguyn khng phi l mt bi ton ch ca h c s d liu phn
tn, mc d i vi c s d liu phn tn n c nhng c trng ring, bi ton ny
c bit n trong cc l thuyt mng vi cch t vn v cp pht cc tp tin.
Gi s rng ta c mt tp cc mnh F = {F
1
, F
2
, ..., F
n
} v mt mng bao gm
cc nt S = {S
1
, S
2
, ..., S
m
}, trn mng c mt tp cc ng dng ang chy App =
{A
1
, A
2
, ..., A
q
}. Bi ton cp pht yu cu tm mt cch phn phi ti u cc mnh F
i

cho cc nt trn S.
Tnh ti u c hiu l cp pht vi chi ph nh nht v vi hiu nng cao
nht. Cc chi ph bao gm khng gian lu tr mi mnh F
i
ti v tr S
j
, chi ph vn tin,
chi ph cp nht, chi ph cho truyn d liu. Hiu nng c tnh trn c s gim thi
gian p ng v tng ti a lu lng ca h thng ti mi v tr.
y l mt bi ton ht sc phc tp, ngi ta phi gii quyt bi ton ny bng
cc phng php heuristic v cng cha c mt phng php no tht s hu hiu
gii bi ton ti u tng qut.

TM TT CHNG
H c s d liu phn tn: H c s d liu phn tn c m t nh l tp hp
nhiu c s d liu c lin quan logic n nhau v c phn b trn mng my
tnh.
H Qun tr c s d liu phn tn: H thng phn mm cho php qun l cc
h c s d liu phn tn v lm cho s phn tn tr nn trong sut i vi
ngi s dng
Kin trc H Qun tr c s d liu phn tn: M hnh ph bin v c nhiu u
im l m hnh client/server.
Thit k phn tn gm ba bi ton ch yu: Phn mnh ngang chia quan h
theo cc b, phn mnh dc chia quan h theo thuc tnh v phn tn ti
nguyn cp pht cc tp tin d liu.

CU HI V BI TP.
1. Hy phn tch cc c trng c bn ca h c s d liu phn tn. Cc khi nim v
X l phn tn, H phn tn, C s d liu phn tn ging nhau v khc nhau
im no?
128
2. Hy phn tch cc u im ca kin trc h qun tr c s d liu phn tn theo m
hnh khch/i l.
3. Hy m t cc chc nng ca tng tng trong kin trc h qun trc CSDL phn tn
theo m hnh khch/i l.
4. Phn tch ngha ca cc quy tc phn mnh trong thit k h c s d liu phn
tn.
5. Hy nu v gii thch ngha ca cc bi ton phn mnh v phn tn ti nguyn.
6. Cho cc v d nu bt tng c bn ca cc phng php phn mnh ngang.
7. tng c bn ca phng php phn mnh dc l g? Cho v d minh ha.