What is the reason why mysql index data structure uses B+ tree?
This article mainly explains the "mysql index data structure to use the B+ tree why", the article explains the content is simple and clear, easy to learn and understand, the following please follow the editor's ideas slowly in-depth, together to study and learn the "mysql index data structure to use the B+ tree why" it!
1. Hash table? No
Considering that there are often range queries in the process of data retrieval (as follows), the hash table does not provide this functionality.
SELECT * FROM hero WHERE age > 5 AND age
