b tree

基本解釋

The index method based on octree and B tree is used to organize the point cloud data.
采用基于八叉樹(shù)與B樹(shù)相結(jié)合的方法來(lái)組織三維點(diǎn)云數(shù)據(jù)。
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 并沒(méi)有采用標(biāo)準(zhǔn)的 B+ 或者 B* 樹(shù)，取而代之的是 B 樹(shù)的一種變體，叫做 H 樹(shù)，它支持更大的子目錄（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.
本文研究了時(shí)態(tài)XML的數(shù)據(jù)模型的建模過(guò)程，并在此數(shù)據(jù)模型上創(chuàng)建了基于B樹(shù)的時(shí)態(tài)XML索引模型，通過(guò)創(chuàng)建索引優(yōu)化了有關(guān)時(shí)間的查詢。