Database MySQL: B + Tree

• index
  • Acceleration data structure query
• Index common data structure
  • Sequential search: time: O (n), a large amount of bad data algorithm efficiency.
  • Find a binary tree: time: O (logn), a binary search tree can be unbalanced.
    
  • hash index: time: O (1), can not meet the scope of search.
  • Red-black tree: time: O (h) = O (logn)
  • B Tree
    
  • B+ Tree