g. Suppose that the file is not
ordered by the key field Ssn and we want to construct a B+-tree access structure (index on SSn. Calculate (i) the orders p and p_leaf
of the B+-tree; (ii) the number of leaf-level blocks needed if if blocks are approximately 69 percent full (rounded up for convenience); (iii) the number of levels needed if internal nodes are also 69 percent full (rounded up for convenience); (iv) the total number of blocks required by the B+-tree; and (v) the number of block accesses needed to search for and retrieve a record from the file - given its Ssn value - using the B+-tree.
h. Repeat part g, but for a B-tree rather than for a B+-tree. Compare your results for the B-tree and for the B+tree.
Formula for order p of a B+ tree:
(p * P) + ((p - 1) * V) <
Formula for p_leaf
of a B+ tree:
* (Pr * V)) + P <
I'm thinking about part h. Here, I need a formula of some kind for a B tree. Can you help me in some way?