Summary of the limitations of btree and hash in MySQL

In the index, the limitations of Btree Index and hash index, here a rough list of

1 Btree Limitations

The nodes in the B-tree are stored sequentially, so you can use the index for lookups (some values are found), or you can order by with the query results (note that the primary key is followed by the order by)
1 The query must start at the leftmost column of the index
2 cannot skip an indexed column
3 The storage engine cannot use the column to the right of the range criteria in the index

2 Limitations of the hash

1 can only satisfy "=", "in" and "<=>" query, cannot use range query
2 cannot be used to avoid sorting operations on data
3 cannot use partial index key query
4 can not avoid the table scan at any time
5 performance does not have to be higher than b-tree indexes when encountering a large number of equal hash values

Summary of the limitations of btree and hash in MySQL