| |
| | KSAM FILE STRUCTURE |
 | | When a key block is full and new keys are added, the root level block may need to be split, causing a new root block to be introduced and adding a new level to the tree. |
 | | However, the exact number of blocks and the size of each block is based on a variety of factors, such as the key size, the number of keys in the file, the number of key values for each key, the key blocking factor, and so forth. |
 | | Each key value is followed by a pointer to a data record and a pointer to the block at the next level with higher key values. |
| docs.hp.com /en/32650-90386/apbs02.html (2151 words) |
|