ohy@pawl17.pawl.rpi.edu (Yong Chul Oh) (06/10/90)
This is the errarata sheet of 'Fundamentals of
DATABASE SYSTEMS' by R. Elmasri and S. B. Navathe.
Some subscripts are represented by normal, but
you may easily notice them.
There is an another posting.
Another posting is MS WORD 4.0 format.
Another posting must be converted with Binhex 4.0.
Yong-Chul Oh
-----------------------------------------------------
ERRATA SHEET
Fundamentals of
DATABASE SYSTEMS
by
R. Elmasri and S.B. Navathe
Page Line From To
48 2 Section 3.5 Section 3.6
117 13 1 < i < k 1 < i < q-1
124 25 that is more that is less
than half full. than half full.
125 Fig 5.12 Change Figure as follows:
step4 node(8,9) node (8)
leaf node(9) leaf node(9,12)
leaf node(12) does not exist
link from (9) to (12) does not exist
125 Fig 5.12 Change Figure as follows:
step5 node(5,8) node(5)
node(7) node(7,8)
node(9) node(9,12)
leaf node(9) leaf node(9,12)
leaf node(12) does not exist
none link from (7,8) to (9,12)
link from (5,8) to (9) delete
link from (9) to (12) delete
126 Fig 5.13 node(8) node(9)
167 4 NO_OF_DEPS>2 NO_OF_DEPS>=2
183 26 Q4: (SELECT PNAME Q4: (SELECT PNUMBER
184 3 (SELECT PNAME (SELECT PNUMBER
193 footnote the embedded query the nested query
(see. footnote on p.184)
201 8 inplementation implementation
216 12 d.NAME = d.DNAME =
217 4 Q4:{p.PNAME Q4:{p.PNUMBER
218 6 ((exist x)(PROJECT(x) ((PROJECT(x)
222 34 the the the
233 18 facililties facilities
234 15 DEP.SSN DEP.ESSN
239 32 DN:packed array DN:packed array [1..15]
[1..15] of char; of char;
NAME:packed array[1.15]
of char;
239 34 readln(DNAME) readln(NAME)
239 36 'Research'; NAME;
305 7 duplicates are not DUPLICATES ARE NOT
allowed ALLOWED
312 12 $GET WORKS ON; delete
317 1 SUPERVISOR_SSn SUPERVISOR_SSN
320 42 cru CRU
321 5 MANAGEs MANAGES
334 35 LOCATIONS field LOCATION field
335 16 if of
373 29 In this case, SSN In this case, DNUMBER
373 31 In this case, SSN In this case, DNUMBER
381 18 nonprime a prime attribute
397 1 bacause because
507 31 set i<-k,j<-l set i<-i+1,j<-j+1
509 last line bE+(rE*xMGRSSN) bE+(rE*(xMGRSSN+1))
=2000+(5000*2) =2000+(5000*3)
=12,000 block accesses =17,000 block acccesses
510 5 bD+(rD*xSSN) bD+(rD*xSSN+1)
=10+(50*4) =10+(50*5)
=210 block access =260 block access
519 26 heuritic heuristic
523 Fig 18.6 W.ESSN W'.ESSN
528 15 (sDNO>5(DEPARTMENT) sDNO>5(EMPLOYEE)
528 31 CS4=xDNO+(bE/2) CS4=xSALARY+(bE/2)
=2+(2000/2)=1002 =3+(2000/2)=1003
530 18 (OP6) (OP5)
530 19 (OP7) (OP6)
530 22 OP6 is jsOP6 = OP5 is jsOP5 =
530 25 OP6 OP5
531 9 OP7 OP6
539 Fig 19.3 Y before X is added, Y before N is added,
579 36 DBMs DBMS
585 20 0recovery recovery
743 19 retreive retrieve
743 21 tF tN
784 42 interface 23,636,639 interface 23,28,29,636,639