Book Cover

Principles of Distributed Database Systems, Fourth Edition

M. Tamer Özsu
Patrick Valduriez

Springer
ISBN 978-3-030-26252-5
2020

Errata

(negative line numbers mean from the bottom with -1 being the last line)
Corrected figures can be downloaded from the Figures page.

<
Page No Line No Error Correction
11 36 trie tree
65 -1 trie-structured tree-structured
66 -8 partitioning trie partitioning tree
99 -7 view trie view tree
140 -5 operator trie operator tree
141 2 down the trie down the tree
142 -4 operator trie operator tree
144 1 Wrong figure Replace select ENO='E5' by join (ENO) - Link to correct figure
146 -6 the trie the tree
150 2 (a) Linear join trie. (b) Bushy join trie (a) Linear join tree. (b) Bushy join tree
150 3 Join trie (c) Join tree (c)
150 -9 operator trie operator tree
150 -5 trie (2 times) tree
150 -4 trie (2 times) tree
150 -3 bushy trie bushy tree
150 -7 bushy trie bushy tree
151 2 trie tree
156 4 trie tree
156 10 trie tree
163 -5 trie tree
166 2 trie tree
166 25 algebra trie (the query trie), algebra tree (the query tree),
169 12 trie tree
171 6 The whole paragraph needs to be replaced As the system gets balanced, its unbalance factor approaches 0 (perfect balance). For example, with load(S1)=10 and load(S1)=30, the unbalance factor of S1, S2 is 100 while with load(S1)=20 and load(S2)=20, it is 0.
173 -14 trie tree
176 15 trie tree
182 2 trie tree
240 4 trie tree
284 -4 trie tree
293 -1 trie tree
313 17 EMP(E#,ENAME,TITLE,CITY) EMP(E#,ENAME,CITY)
318 -12 trie tree
318 -10 trie (2 times) tree
318 -6 trie tree
319 3 trie tree
321 1 Fig. 7.14 Hierarchical cost formula trie Fig. 7.14 Hierarchical cost formula tree
325 -11 trie tree
325 -10 trie tree
325 -7 trie tree
325 -5 trie tree
326 5 trie tree
326 20 trie tree
326 23 trie tree
326 -11 trie tree
335 1 trie tree
364 9 trie tree
369 -3 trie tree
370 6 trie tree
370 14 trie tree
370 17 trie tree
371 5 trie tree
371 8 trie tree
372 1-2 trie (3 times) tree
372 13 trie tree
372 Fig. 8-15(b) join attribute B join attribute A
379 1-2 trie (4 times) tree
379 18 trie tree
379 -7 trie tree
379 -6 trie tree
380 11 trie tree
381 -12 trie tree
382 -3 trie tree
403 -3 trie tree
403 -2 trie tree
403 -1 trie tree
404 3 trie tree
404 8 trie tree
404 10 trie tree
404 11 trie tree
404 12 trie tree
404 13 trie tree
404 16 trie tree
404 18 trie tree
404 21 trie tree
404 -17 trie tree
419 -4 trie tree
426 20 trie tree
426 21 trie tree
426 24 trie (2 times) tree
426 27 trie tree
426 -9 trie tree
426 -1 trie (2 times) tree
427 -12 trie tree
427 -11 trie tree
434 9 trie tree
447 -9 trie tree
453 19 trie tree
453 22 trie tree
486 7 G=(V,E, Dv,DE) G=(V,E, DV,DE)
488 formula PR(PI)=... PR(Pi)=...
528 1-7 Wrong figure Replace by MongoDB architecture
559 3 trie tree
577 -8 trie tree
578 -6 trie tree
578 -4 trie tree
578 -2 trie tree
579 2 trie tree
579 3 trie tree
579 4 trie (4 times) tree
579 5 trie tree
579 7 trie (2 times) tree
580 1 trie tree
583 1 trie tree
583 6 trie tree
590 -6 Semantic!web Semantic web
591 21 Semantic!web Semantic web
593 8 trie tree
593 12 trie tree
593 24 trie tree
593 26 trie tree
593 28 trie tree
593 -4 trie tree
593 -3 trie tree
596 -7 U, B, L, and V U, B, and L
596 -6 ..., blank nodes, literals, and variables, ... ..., blank nodes, and literals, ...
603 -6 and -7 (see the number of NULLs in Fig. 12.19) --
664 trie (2 times) tree
666 trie tree
668 trie tree
669 trie (3 times) tree
670 trie tree
671 trie (2 times) tree
674 trie (2 times) tree