H v tn: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / MSSV: . . . . . . . . . . . . . . . . . . . . . . .

thi gia k - Hc k II (2009-2010) A Mn: H Qun Tr C S D Liu - Thi gian: 60 pht (Khng c tham kho ti liu, ngoi tr hai t giy kh A4, cha nhng ghi ch cn thit) Sinh vin in H v tn, MSSV v lm bi vo thi (vit r rng v ngn gn). Phn A (Trc nghim) (4 im) (Mi cu 0.25 im)
A1. Chn pht biu sai nht trong cc pht biu sau: A. Mc tin lp ch mc (indexing field) l mc tin dng to ch mc (index) B. Mc tin lp cm (clustering field) c th l cc kho ngoi ca mt tp tin C. Ch mc dy (dense index) l khi cc mc tin ch mc nm k nhau trn (tp tin) ch mc D. Ch mc s cp (primary index) gm cc mc ch mc (index entry) gm 2 thnh phn: kho chnh v con tr khi (block pointer). A2. Cc gii thut c th dng trong php kt 2 quan h l: (chn cu ng nht) A. Nested-loop join, Hash join v Sort-merge join B. Single-loop join v Double-loop join C. Nested-loop join, Sort-merge join v Index join D. Tt c cc cu trn u ng A3. Mt a cng c cc thng s nh sau: thi gian nh v track (seek time) s=5 msec, rotation delay rd=4.2 msec, transfer rate tr=2304 bytes/msec v block transfer time btt=0.22 msec. Chn cu sai trong cc cu sau: A. Thi gian truyn k=10 block khng lin tc trn cng mt track l 11.4 msec B. Thi gian truyn k=13 block khng lin tc trn cng mt track l 62.46 msec C. Thi gian truyn k=4 block lin tc trn cng mt track l 10.08 msec D. Tt c cc cu trn u ng A4. Cu trc tp tin (file organization) v phng php truy t (access method): A. C lin quan n nhau B. Khng c lin quan n nhau C. L cng mt khi nim D. C A,B v C u sai A5. Chn cu ng: A. Mt tp tin c th c nhiu primary index hoc nhiu clustering index. B. Mt tp tin c th c mt primary index v vi secondary index. C. Mt tp tin c nhiu secondary index th khng th c clustering index D. Mt tp tin ch c th dng clustering index khi n c kho chnh A6. Bit rng cc kch thc block, kho, block pointer v record pointer trong 2 cy B v B+ l ging nhau, pht biu no ng nht trong cc pht biu sau: A. Bc p ca cy B v p cc nt trung gian ca cy B+ l bng nhau B. Bc pleaf nt l ca cy B+ bng bc p cc nt trung gian ca n cng 1 C. Ch c cc thnh t (entry) cc nt l ca cy B mi cha cc record pointer D. Cc thnh t (entry) cc nt trung gian ca cy B+ khng cha cc record pointer A7. H s phn khi bfri ca mt ch mc cng chnh l A. s khi ca ch mc B. phn nhnh (fan-out) ca ch mc C. s mc ca ch mc khi t chc thnh ch mc a mc D. s ln truy t khi trn ch mc A8. Mt tp tin hash c th c m rng v thu nh bng cch: A. Dng extendible hashing B. Dng linear hashing C. C A v B u ng D. Tp tin hash khng th m rng c v bng hash khng th thay i kch thc A9. Pht biu no sau y l ng nht A. Trong ch mc cm, s phn t trong tp tin ch mc bng vi s bn ghi trong tp tin d liu B. Trong ch mc cm, s phn t trong tp tin ch mc bng vi s tr khc bit nhau m thuc tnh lp ch mc c th c. C. Ch mc cm lun lun l ch mc dy. D. Ch mc th cp lun lun l ch mc tha. A10. Mt a cng c cc thng s block size B=512 bytes; interblock gap G=128 bytes; s block/track=20; c tc quay l p=7200 rpm. Tc truyn transfer rate tr l: A. 1536 bytes/msec B. 1228.8 bytes/msec C. 1520.6 bytes/msec D. 1552 bytes/msec A11. Ch mc a mc tnh (static multilevel index) vn cn s bt tin no sau y: A. phi cp pht b nh d tha kh nhiu B. phi duy tr th t khi thm v xa phn t trong ch mc C. tn thm nhiu ln truy t khi D. c A v B l ng A12. Mt a cng c cc thng s block size B=512 bytes; interblock gap G=128 bytes; c tc quay l p=5400 rpm (vng/pht) v tc truyn tr=1152 bytes/msec. Chn cu ng nht trong cc cu sau:

Thi gia k HK2/2010 Mn: DBMS

H v tn: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / MSSV: . . . . . . . . . . . . . . . . . . . . . . .
A. Rotation delay rd = (1/2)*(1/p) min = (60*1000)/(2*p) msec = 30,000/5400 5.6 msec B. Seek time s = 1/p min = (60*1000)/p msec = 60,000/5400 11.1 msec C. Block transfer time btt = B/tr = 512/1152 0.44 msec D. Block transfer time btt = (B+G)/tr = (512+128)/1152 0.56 msec A13. File header (file descriptor) cha ng thng tin no sau y: A. Con tr ch n block u tin ca tp tin trn a B. Tp a ch ca cc block ca tp tin trn a C. M t nh dng ca tp tin D. C B v C u ng A14. Mt a cng c cc thng s block size B=512 bytes; interblock gap G=128 bytes; s block/track=20; s track/mt a=400 v c 15 a 2 mt. Chn cu ng trong cc cu sau: A. Dung lng tng cng ca a cng l: 15*2*400*20*512 = 122,800,000 bytes B. a cng ny c 400*2 = 800 cylinder C. Dung lng hiu dng ca mt cylinder l: 15*2*20*512 = 307,200 bytes D. Ch c cu A v B l ng A15. Gii thut sau y l gii thut thc hin php ton tp hp no:
sort the tuples in R and S using the same unique sort attributes; set i 1, j 1; while (i n) and (j m) do { if R(i) > S(j)then set j j+1 elseif R(i) < S(j) then { output R(i) to T; set i i+1 } else set i i+1, j j+1 } if (i n) then add tuples R(i) to R(n) to T;

A. hi B. giao C. hiu D. C 3 cu trn u sai. A16. Cho cc quan h R(A,B,C) v S(D,E,F), chn pht biu sai: A. B (A,B (A,B,C (R))) = B (R) B. B= E AND D= A (R S) = (B= E (R)) (D= A (S)) C. B (C= 123 (R)) = C= 123 (B (R)) D. B (A=D (R S)) = B (A=D ((A,B (R)) (D (S))))

Phn B (6 im) B1. (2 im) Cho mt a cng vi cc kch thc block l B = 512 byte, block pointer l P= 6 byte v record pointer PR = 7 byte. Cho mt tp tin d liu gm 30000 bn ghi EMPLOYEE. Mi bn ghi gm cc mc tin sau: NAME (30 byte), SSN (9 byte), DEPTNO (9 byte), ADDR (40 byte), PHONE (9 byte), BDATE (8 byte), SEX (1 byte), JOBCODE (4 byte), SALARY (4 byte). Thm mt byte vo bn ghi dnh cho deletion marker. Gi s tp tin khng sp th t theo thuc tnh JOBCODE v chng ta mun to mt cu trc ch mc th cp theo JOBCODE theo cch dng mt mc trung gian cha cc record pointer. Gi s rng ch c 500 tr khc nhau cho JOBCODE v cc bn ghi ca tp tin EMPLOYEE phn b u theo cc tr ny. 1. Tnh H s phn khi bfri ca ch mc th cp ny. 2. Tnh s phn t (entry) ca ch mc th cp v s khi ca ch mc th cp khi ch mc ch c mt mc. 3. Nu chng ta t chc ch mc ny thnh mt cu trc a mc th s mc cn thit trong trng hp ny l bao nhiu. Gii thch. 4. Gi s chng ta t chc ch mc ny thnh mt cu trc 2 mc (v mt mc trung gian nh ni), tnh s ln truy t khi cn thit khi dng ch mc trn tm kim v truy xut tt c cc bn ghi t tp tin d liu khp vi mt tr JOBCODE cho 25 trc. B2. (2 im) Cho mt cy B+ vi s pointer cho mi nt ni ti a l p = 3 nh trong hnh v bn cnh. Hy v cc cy B+ gy ra do xa ln lt cc tr kha sau y 36, 37, 34.
11 8 11 12 14 14 34

22

25

27

34

36

37

B3. (2 im) Cho 3 quan h: Employee(SSN, Name, Age, Address), Project(Proj#, Title, Location) v WorkOn(SSN, Proj#, Salary). V cho cu truy vn SQL sau y: Thi gia k HK2/2010 Mn: DBMS A

H v tn: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / MSSV: . . . . . . . . . . . . . . . . . . . . . . . SELECT Name FROM Employee, WorkOn, Project WHERE Age>35 AND Location = HCM City AND Salary=1000 AND Employee.SSN = WorkOn.SSN AND WorkOn.Proj# = Project.Proj# 1. (0.5 im) V cy truy vn khi u s dng php ton tch Cc cho cu truy vn nu trn. 2. (1.5 im) ng dng cc lut heuristic bin i cy truy vn ban u thnh cy truy vn biu thi mt trnh t thc thi hu hiu cho cu truy vn nu trn. Bit rng cc d n (Project) thc hin ti HCM City th t hn s cc nhn vin c tui (Age) > 35 v t hn s nhn vin lm vic c lng trong d n l 1000. B4. (Dnh cho lp KSTN 1 im: gim B2&B3 mi cu 0.5 im) Cho mt cy B+ vi s pointer cho mi nt ni ti a l p = 34 v pleaf = 31. Gi s mi nt ca cy ny y n 80%. 1. Tnh xem cy ny c th ch n bao nhiu record nu chiu cao cy l 3. 2. Nu cy ny lm ch mc cho tp tin c khong 450,000 record th s lng truy t khi (block access) tm mt record l bao nhiu?

PHN BI LM
Phn A (Trc nghim) (4 im) (Mi cu 0.25 im) 1 A B C D 2 3 Bng tr li trc nghim (sinh vin t vo c chn tr li) 4 5 6 7 8 9 10 11 12 13 14 15 16

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

O O O O

Phn B (6 im)

Thi gia k HK2/2010 Mn: DBMS

H v tn: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / MSSV: . . . . . . . . . . . . . . . . . . . . . . .

Thi gia k HK2/2010 Mn: DBMS