while Mysql chooses B+ tree

Preface: This article is organized by the editor of Programming Notes#. It mainly introduces the simplest way to understand why MongoDB index chooses B-tree, while Mysql chooses B+ tree. I hope it will be of certain reference value to you. . This problem was mentioned by the teacher when I was watching the video. Although I knew their respective index structures before, I have not studied them yet. reason. There are many answers when searching online. But they are all very wordy. So that concludes this article. 1. The difference between B-tree and B+ tree Obviously, if we want to understand the reason, we need to know the difference between B-tree and B+ tree. In order not to go into too much detail. We directly give their form to summarize their characteristics. 1. B-tree B-tree is a self-balancing search tree with a very simple form: This is a B-tree. The core features of our problem are as follows: (1) Multi-way, non-binary tree (2) Each node saves both the index and the data (3) When searching Equivalent to binary search Here we assume that we all already understand the structure related to the B-tree. 2. B+ tree B+ tree is a…