2. Hashing algorithm

4. key
Buket size 1
Buket size 2
Buket size 3
Remainer
Load factor 45 11 3
size 1 33 16 5
size 2 22 1 2
size 3
0.8 4 72 66 15 70 35 62 6 68 34 67
divisor = 17
divisor = 7
divisor = 5

5. The structure of the leaf nodes of a B+-tree of order p (Figure 14
The structure of the leaf nodes of a B+-tree of order p (Figure 14.11b) is as follows:
Each leaf node is of the form
<<K1, Pr1> , <K2, Pr2>, ..., <Kq-1, Prq-1>, Pnext>
Where q 1 p, each Pri is a data pointer, and Pnext points to the next leaf node of the B+-tree.
Within each leaf node, K1 < K2 < ... < Kq-1, q 1 p.
Each Pri is a data pointer that points to the record whose search field value is Ki or to a file block containing the record (or to a block of record pointers that point to records whose search field value is Ki if the search field is not a key).
Each leaf node has at least (p/2) values.
All leaf nodes are at the same level.

8. Figure page 858

9. B+ Tree (slide 50- book p858) 8, 5, 1, 7, 3, 12, 9, 6