1、B-Tree operations tend to be limited to a single cluster.
型樹操作往往被限制在單一的集群中。

2、The B-Tree Scanner threads remove deleted index entries and rebalance the index nodes.
B - TreeScanner線程會(huì)去掉刪除的索引項(xiàng)并重新平衡索引節(jié)點(diǎn)。

3、This feature supports B-tree indexes and functional indexes.
該特性支持B -樹索引和功能性索引。

4、All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
所有數(shù)值型hash值都使用DB 2內(nèi)部的B -樹索引中的索引擴(kuò)展來存儲(chǔ)。

5、The B-tree would store the key value, followed by a list of pointers to each of the physical rows.
B-樹將存儲(chǔ)鍵值，以及一個(gè)指向每個(gè)物理行的指針列表。

6、Time required to list off keys in a B-tree in sorted order?
要求列出了密鑰樹的順序的時(shí)間嗎？

7、The B-Tree Scanner automatically determines which index items are to be deleted.
B - TreeScanner自動(dòng)判斷哪些索引項(xiàng)應(yīng)該刪除。

B-tree翻譯