1. 011 221 302 325 … 907 … 011Train… 012Doll 106Car 200… 221 250 267 299 302 315 322 323 325 … 907 928 958 985 … Index File Data File (TOY) Blocking factor: 4 records per block Primary Index

2. FP FY PS … FPFarm… FPDoll FPCar FY… PS … 907 928 958 985 … Index File Data File (TOY) Blocking factor: 4 records per block Index points to first block that has corresponding data field Clustering Index

3. 1 2 3 4 5 6 7 8 1… 8 3 6 2 5 4 7 … … Index File Data File Blocking factor: 2 records per block Index points to beginning of the block that has corresponding data field Secondary Index

4. 2 5 8 12 15 21 24 29 35 36 39 41 44 46 51 52 55 58 63 66 71 78 80 82 85 Data File Blocking factor: 2 records per block Multilevel Index 2 8 15 24 35 39 44 51 55 63 71 80 85 2 35 55 85

5. The nodes of a B+-tree. (a) Internal node of a B+- tree with q –1 search values. (b) Leaf node of a B+- tree with q – 1 search values and q – 1 data pointers.

6. An example of insertion in a B+-tree with q = 3 and p leaf = 2.

7. FIGURE 14.13 An example of deletion from a B+-tree.