b-tree造句

例句与造句

1. Represents a heap or b - tree involved in a deadlock
   表示死锁所涉及的堆或b树。
2. Nonleaf pages in the b - tree are not included in the count
   （未计入b树中非叶页的数目。
3. Hbt lock on a heap or b - tree index
   Hbt =堆或b树索引的锁。
4. B - tree level : depth of the index from its root block to its leaf blocks
   B * -树级别：从根块到叶块的索引深度。
5. Points to the top of the clustered index b - tree in the specified partition
   列指向指定分区内聚集索引b树的顶端。
6. It's difficult to find b-tree in a sentence. 用b-tree造句挺难的
7. The server uses the index b - tree to find the data pages in the partition
   服务器使用索引b树查找分区中的数据页。
8. Tables of this type are stored in b - tree with page - level locking
   开发的这种表类型存储在b树中，它支持页级锁定。
9. This count includes nonleaf b - tree pages , iam pages , and all pages included in the
   该计数包括非叶b树页、 iam页以及
10. Used to synchronize access to the root page abstraction of an internal b - tree
    用于同步对内部b树的根页抽象的访问。
11. Represents a heap or a b - tree
    表示堆或b树。
12. Points to the top of the nonclustered index b - tree in the specified partition
    列指向指定分区内非聚集索引b树的顶端。
13. Nonclustered indexes have a b - tree index structure similar to the one in clustered indexes
    非聚集索引与聚集索引有一个相似的b树索引结构。
14. A heap or b - tree can have only one allocation unit of each type in a specific partition
    在堆或b树的特定分区中，每种类型只能有一个分配单元。
15. Fractal prefetching b - trees : optimizing both cache and disk performance . in proc
    实验结果还表明， minitasking的参数配置基本上和查询类型无关。
16. For an index , one row is returned for each level of the b - tree in each partition
    对于索引，针对每个分区中的b树的每个级别，返回与其对应的一行。
更多例句：  下一页