B+ tree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]
English Wikipedia has an article on:
Wikipedia

Noun

[edit]

B+ tree (plural B+ trees)

  1. (computing theory) An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves.
[edit]
Retrieved from "https://en.wiktionary.org/w/index.php?title=B%2B_tree&oldid=74757221"