b tree

基本解释

The index method based on octree and B tree is used to organize the point cloud data.
采用基于八叉树与B树相结合的方法来组织三维点云数据。
Instead of the standard B+ or B* tree, ext4fs uses a variation of the B tree, called the H tree, which allows much larger subdirectories (ext3 was limited to 32KB).
ext4fs 并没有采用标准的 B+ 或者 B* 树，取而代之的是 B 树的一种变体，叫做 H 树，它支持更大的子目录（ext3 的上限为 32KB ）。
In this thesis, we study the process of temporal XML modeling. Up on this model we propose an indexing scheme based on B tree and optimize queries relevant to time.
本文研究了时态XML的数据模型的建模过程，并在此数据模型上创建了基于B树的时态XML索引模型，通过创建索引优化了有关时间的查询。