Class DataBTree


  • public class DataBTree
    extends Object
    This holds the chunked data storage. level 1A A B-tree, version 1, used for data (node type 1) Version 1 B-trees in HDF5 files an implementation of the B-link tree, in which the sibling nodes at a particular level in the tree are stored in a doubly-linked list The B-link trees implemented by the file format contain one more key than the number of children. In other words, each child pointer out of a B-tree node has a left key and a right key. The pointers out of internal nodes point to sub-trees while the pointers out of leaf nodes point to symbol nodes and raw data chunks. Aside from that difference, internal nodes and leaf nodes are identical.
    Since:
    6/27/12
    See Also:
    "http://www.hdfgroup.org/HDF5/doc/H5.format.html#Btrees"