Shulou(Shulou.com)06/02 Report--

Editor to share with you the example analysis of the index structure in mysql, I believe that most people do not know much about it, so share this article for your reference, I hope you can learn a lot after reading this article, let's go to know it!

An index is an ordered data structure that helps mysql obtain data efficiently.

Index data structure

Select * from A where col1= 6

Binary tree: easy to grow unilaterally, search more times from the root node, not suitable

Red-black tree: the height of the tree is not suitable, there is a large amount of data, and it is not suitable for searching from the root node.

Hash table: hash col1= 6 to get the disk address pointer. However, when col1 > 6 (range search is not supported), the full table will be scanned, which is not suitable

B-tree: index structure

Https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Red-black tree (balanced binary tree), the process of spin balance

The above is all the content of the article "sample Analysis of Index structure in mysql". Thank you for reading! I believe we all have a certain understanding, hope to share the content to help you, if you want to learn more knowledge, welcome to follow the industry information channel!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.