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索引模型，通過創建索引優化了有關時間的查詢。