Definitions for b-tree
This page provides all possible meanings and translations of the word b-tree
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.
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.
Anagrams of b-tree
Find a translation for the b-tree definition in other languages:
Select another language: