Multi-Tree-b-tree

In B-Definition:
Each node has an M child and a m-1 key.
The key values for each node are sorted from small to large
The key of the former I child is smaller than the first key
After m-1 a child's key is greater than the first key

M Path Lookup method:
First, the root node is fetched, the keyword contained in the root node K1,..., kj to find the given keyword (available order lookup or binary lookup method),
Find success If you find a keyword equal to the given value; otherwise, you can be sure that the keyword you want to check is between some ki or ki+1,
The node that pi refers to is then searched until it is found, or if the pointer pi is empty, the lookup fails.

B-Tree structure diagram