2024-07-11
한어Русский языкEnglishFrançaisIndonesianSanskrit日本語DeutschPortuguêsΕλληνικάespañolItalianoSuomalainenLatina
在Mysql中索引是在存储引擎层实现的,而不是在服务层实现的
Features:Each node has at most two child nodes, the left one is small and the right one is large.The more random the data, the more obvious the branches are.
Set the id of the following table as the index
就是将id列按照二叉树的数据结构存储起来
If the data is entered sequentially at once
The height of the tree will be very high (it is a linked list structure). At this time, the efficiency of element search is equal to linked list query O(n), and the data retrieval efficiency will be extremely low.