B treewww.cs.usfca.edu/~galles/vis…
B + treewww.cs.usfca.edu/~galles/vis…
Advantages of B+ tree over B tree:
InnoDB B+Tree features: 1) it is a variant of B Tree, B Tree can solve problems, it can solve. What are the two biggest problems solved by B Tree? (More keywords per node; 3) The disk read and write ability of B+Tree is stronger than that of B Tree (the root node and branches do not save data area. So a node can store more keywords and load more keywords at a time) 4) stronger sorting ability (because there is a pointer to the next data area on the leaf node, the data forms a linked list) 5) more stable efficiency (B+Tree always gets data from the leaf node, so the IO count is stable)Copy the code