January 2004
Intermediate to advanced
432 pages
11h 1m
English
Let's examine the b-tree structures in Listings 6.9 and 6.10.
We start off with a pointer to the root (first) bnode and record the depth of the b-tree 0 0 4 0 * b_root 4 0 4 0 int b_depth Next we find the number of pages mapped and the number of swap pages reserved for this tree 8 0 4 0 int b_npages 12 0 4 0 int b_rpages The page list pointer directs us to this region's page list, and nfrag points to the next available chunk (required if we need to grow the tree) 16 0 4 0 * b_list 20 0 4 0 int b_nfrag This pointer gets us back to the region structure this b-tree serves 24 0 4 0 * b_rp 28 0 4 0 int b_protoidx There are two sets of prototype dbd structures used when the b-tree is being ... |
Read now
Unlock full access