BabelNet

bn:03234827n

Noun Named Entity

Categories: Computer-related introductions in 1971, All articles needing additional references, Database index techniques, long volume value, B-tree

B-tree B*-tree B* tree B-star tree B-trees

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

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

HAS KIND