Next: , Previous: B-tree Structure and Access, Up: B-tree Structure and Access

2.1.1 Definitions



root block

internal block

leaf block

prefix compression

Instead of storing the full text of each key, store the length of match with the previous key (in this block) and the text of the key which doesn't match.

suffix compression

In non-leaf blocks, only store enough of the split-key to differentiate the two sequential blocks at the lower level.