b-tree 中文意思是什麼

b-tree 解釋
b樹
  • b :
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. Dbpropval it btree - the index is a b - tree. dbpropval it hash - the index is a hash file using, for example, linear or extensible hashing

    Dbpropval _ it _ hash -該索引是使用例如線性或可擴展哈希演算法的哈希文件。
  2. An allocation group keeps track of its own inodes by using a b tree that records where each particular inode number can be found on disk

    每個分配組通過使用b +樹來跟蹤自己的索引節點，該b +樹記錄著特定索引節點號在磁盤上的位置。
  3. This count includes nonleaf b - tree pages, iam pages, and all pages included in the

    該計數包括非葉b樹頁、 iam頁以及
  4. On the basis of analysis by consistent query answer of inconsistent database, and of nonaggregate constraints, keyword as metadata, the principle of the b - tree and binary tree, found a new research method to inconsistent database

    摘要在分析非一致性數據庫一致性查詢方法的基礎上，結合非聚集約束條件，以關鍵詞為元數據，利用b -樹與二叉樹的原理，提出一種新的針對非一致性數據庫的查詢方法。
  5. Nonclustered indexes have a b - tree index structure similar to the one in clustered indexes

    非聚集索引與聚集索引有一個相似的b樹索引結構。
  6. I study mainly the storage of record and object, and bring forward the method of storage when the instance of object is embodied inside of record. 3 ) in the aspect of indexing, i presented a method that is generalized b - tree ( gbt ) and combining technique of founction template of c + + build the universal algorithm of queries, insert and delete. 4 ) finally, i analyze deeply and improve the query processing system of ormdbms, and confirm performance algorithm of linking and queries based on relational database. management system ( rdbms )

    在系統結構和特性中分析了系統所採用的兩層體系結構，並且詳細探討了在設計和實現數據庫時所涉及到的幾個主要問題：支持復雜對象、類型擴充、繼承機制和規則系統等；在存儲機制的討論中，主要研究了記錄和對象以及包含了對象實例記錄的存儲方法；在索引技術研究中，本文提出了類屬b樹的索引方法，通過c + +的函數模板技術給出了通用類屬b樹查詢、插入及其刪除的基本演算法；最後，文章以關系數據庫為基礎，深入分析並改進了在對象關系多媒體數據庫中的查詢處理系統，確定了選擇和連接操作的具體演算法。
  7. Nonleaf pages in the b - tree are not included in the count

    （未計入b樹中非葉頁的數目。
  8. If the lock escalation attempt succeeds and the full table lock is acquired, then all heap or b - tree, page page, key - range, or row - level locks held by the transaction on the heap or index are released

    如果鎖升級嘗試成功並獲取全表鎖，將釋放事務在堆或索引上所持有的所有堆或b樹鎖、頁鎖（ page鎖） 、鍵范圍鎖（ key鎖）或行級鎖（ rid鎖） 。
  9. Represents a heap or b - tree involved in a deadlock

    表示死鎖所涉及的堆或b樹。
  10. R - tree, like b + tree, is dynamic balanced tree, the search key is based on spatial object ' s minimum bounding rectangle

    R樹是一種類似於b ~ +樹的動態平衡樹，其索引項基於空間對象的最小外接矩形。
  11. The second organization is used for larger directories and represents each directory as a b tree keyed on name

    第二種組織用於較大的目錄，用按名字鍵控的b +樹表示每個目錄。
  12. The contribution of this dissertation : an image retrieval approach based on dct compressed domain is proposed. first, reorder dct coefficients using multiresolution wavelet transform, then build subband energy histograms formed from reordered dct coefficients of database images, build indices of images by using morton order and order database for indexing by using variant b - tree data structure

    本論文的貢獻：提出了一種將jpeg圖象的dct系數按照多解析度小波變換的形式進行重組，得到若干子帶並建立子帶能量直方圖作為特徵，在按照morton的順序建立索引，並對索引採用變形b樹數據結構組織，進行檢索的方法。
  13. Hbt lock on a heap or b - tree index

    Hbt =堆或b樹索引的鎖。
  14. All internal data structures, such as b - tree indexes or doubly - linked lists, must be correct at the end of the transaction

    事務結束時，所有的內部數據結構（如b樹索引或雙向鏈表）都必須是正確的。
  15. The clustered index is implemented as a b - tree index structure that supports fast retrieval of the rows, based on their clustered index key values

    聚集索引按b樹索引結構實現， b樹索引結構支持基於聚集索引鍵值對行進行快速檢索。
  16. These algorithms lead to optimal join performance : nodes that do not participate in the join can be judged beforehand and then skipped using b - tree index. besides, each element list joined is scanned sequentially once at most. furthermore, output of join results is sorted in document order

    其次，提出了兩個高效的兄弟關系的結構連接演算法，這兩個演算法具有較好的連接性能：不參與連接的結點可以事先判斷出來並利用b樹跳過，連接的兩個列表最多都只需掃描一次，而且連結結果按照文檔序有序。
  17. The addressing structure is a b tree populated with extent descriptors the triples above, rooted in the inode and keyed by logical offset within the file

    尋址結構是一棵b +樹，該樹由盤區描述符（上面提到的三元組）填充，根在inode中，鍵為文件中的邏輯偏移量。
  18. B - tree level : depth of the index from its root block to its leaf blocks

    B * -樹級別：從根塊到葉塊的索引深度。
  19. Points to the top of the clustered index b - tree in the specified partition

    列指向指定分區內聚集索引b樹的頂端。
  20. The server uses the index b - tree to find the data pages in the partition

    服務器使用索引b樹查找分區中的數據頁。
分享友人
分享到 Line

分享到臉書