Show
Definition & Meaning | English word B-TREE
B-TREE
Definitions of B-TREE
- (computing) An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk accesses required for locating the correct record block.
Number of letters
6
Is palindrome
No
Search for B-TREE in:
Examples of Using B-TREE in a Sentence
- In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.
- Most databases use some variation of the B-tree for this purpose, although the original IBM ISAM and VSAM implementations did not do so.
- In addition to an improved split strategy, the R*-tree also tries to avoid splits by reinserting objects and subtrees into the tree, inspired by the concept of balancing a B-tree.
- Links between records (edges) are stored either as the record's position stored directly inside of the referrer or as B-tree of record positions (so-called record IDs or RIDs), that serves as a container of RIDs, which allows fast traversal (with O(1) complexity) of one-to-many relationships and fast addition/removal of new links.
Page preparation took: 649.36 ms.
