Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03234827n
Noun Named Entity
Categories: All Wikipedia articles needing clarification, Database index techniques, long volume value, Articles with short description, B-tree
EN
B-tree  B*-tree  B* tree  B-star tree  B-trees
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
A data structure Wikipedia Disambiguation
A self-balancing, tree-based data structure, that allows read/write access in logarithmic time Wikidata
IS A
data structure
(a,b)-tree
search tree
HAS KIND
fusion tree
dancing tree
queap
2–3 tree
2–3–4 tree
+1 relations
DIFFERENT FROM
binary tree
DISCOVERER OR INVENTOR
Edward M. McCreight
Rudolf Bayer
STUDIED BY
graph theory
USES
tree
Wikipedia
EN
B-tree
Wikidata
EN
B-tree
Wikipedia Redirections
EN
B*-tree, B* tree, B-star tree, B-Tree, B-trees, B.tree, B tree, B tree indexing, Bayer tree, BTree, btrees
Wikidata Alias
EN
B tree, balanced multiway tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License