Why MongoDB uses B-tree?

Does MongoDB use B+ tree?

MongoDB uses B+ by WiredTiger default storage engine. Starting in MongoDB 3.2, the WiredTiger storage engine is the default storage engine. WiredTiger maintains a table's data in memory using a data structure called a B-Tree ( B+ Tree to be specific), referring to the nodes of a B-Tree as pages.

Why do databases use B+ trees?

B-tree used for indexing and B+tree used to store the actual records. B+tree provides sequential search capabilities in addition to the binary search, which gives the database more control to search non-index values in a database.

Why is B+ tree better?

The principal advantage of B+ trees over B trees is they allow you to pack in more pointers to other nodes by removing pointers to data, thus increasing the fanout and potentially decreasing the depth of the tree. The disadvantage is that there are no early outs when you might have found a match in an internal node.

Why are B+ trees used instead of binary search trees in databases?

The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.