Assertion: tree | /r/HasAspect | high fanout
Facets:
value: very
type: DEGREE
value: unlike binary search trees
type: OTHER
Source sentences:
text: This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in a node, typically on the order of 100 or more), which reduces the number of I/O operations required to find an element in the tree.