On this page:
Definition of the noun B-Tree
What does B-Tree mean as a name of something?
- [computing] An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk hits required for locating the correct record block.
- antonym: binary tree
"B-Tree" a.k.a. "Tree I" is a sculpture (stainless steel) by Kenneth Snelson, begun in and completed in (34 years ago).
- read more about Tree I
- B-tree: In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children. Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. It is commonly used in databases and filesystems.
- also known as B*-tree
- B-tree a.k.a. B+ tree: A B+ tree is an n-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.
- also known as B+树
- B-tree a.k.a. B# Tree: A B# tree is a data structure similar to a B+ tree with rotations allowed among immediate siblings only.
Printed encyclopedias and other books with definitions for B-tree
Click on a title to look inside that book (if available):
Networked Systems (2013)
First International Conference, NETYS 2013, Marrakech, Marocco, May 2-4, 2013, Revised Selected Papers by Vincent Gramoli, Rachid Guerraoui
B-tree is a widely used data-structure indexing data for efficient Retrieval. We consider a decentralized B-tree, were parts of the structure are distributed among different processors and some parts are replicated, thus providing a decentralized ...
Open Data Structures (2013)
An Introduction by Pat Morin
For any integer B ≥ 2, a B-tree is a tree in which all of the leaves have the same depth and every non-root internal node, u, has at least B chil- dren and at most 2B children. The children of u are stored in an array, u.children. The required ...
Transaction Processing (2015)
Management of the Logical Database and its Underlying Physical Structure by Seppo Sippu, Eljas Soisalon-Soininen
Because of its balance conditions that must be maintained under all circumstances, the B-tree is a highly dynamic structure in which records are often moved from one page to another in structure modifications such as page splits caused by ...
Encyclopedia of Algorithms (2008)
by Ming-Yang Kao
By the above definitions, a B-tree is a (b/2; b)-tree (if b is even) or an (a;2a 1)-tree (if b is odd). The subtle difference between even and odd maximum degree becomes relevant in an ...
Volume 7 - Evolution of Computerized Maintenance Management to Generation of Random Numbers by Allen Kent, James G. Williams
A B-tree of order 3(a) before "E" (b) after "E." has no parent, one is created, and will have exactly two successors, satisfying rule (1). Finally, since this splitting has no effect on the level of the leaves, apart from moving them all down one level if ...
by Khosrow-Pour, D.B.A., Mehdi
The third data structure also uses indirection, and insertions and deletions always match the B-tree bound. Argeet. al. proposed a cache oblivious R-tree ( Arge, Berg, & Haverkort, 2009). They created a cache oblivious data structure to store a ...
Online dictionaries and encyclopedias with entries for B-tree
Click on a label to prioritize search results according to that topic:
Photos about B-tree
Click on an item to view that photo:
Video about B-tree
Video shows what B-tree means. An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk hits required ...
Quotes about B-tree
Tree makes life free
Do not cut tree
It is lifes industry
Life is in forestry.
Tree's talk listen
Silently tree given us
And we survive for
Tree only and tree make us
Enjoy our vacation. (Gajanan Mishra)
more quotes about b-tree...
Anagrams of B-TREE
What do you get if you rearrange the letters?
See also the blanagrams of B-tree!
Share this page
Go to the usage examples of B-tree to see it in context!