public class BTree2
extends java.lang.Object
// Level 1A2
These are used for symbols, not data i think. Version 1 is H5header.GroupBTree.
Version 2 B-trees are "traditional" B-trees, with one major difference. Instead of just using a simple pointer
(or address in the file) to a child of an internal node, the pointer to the child node contains two additional
pieces of information: the number of records in the child node itself, and the total number of records in the child
node and all its descendents. Storing this additional information allows fast array-like indexing to locate the n'th
record in the B-tree.
The entry into a version 2 B-tree is a header which contains global information about the structure of the B-tree.
The root node address field in the header points to the B-tree root node, which is either an internal or leaf node,
depending on the value in the header's depth field. An internal node consists of records plus pointers to further leaf
or internal nodes in the tree. A leaf node consists of solely of records. The format of the records depends on the
B-tree type (stored in the header).
- Since:
- 6/27/12