Home > database >  MySQL index with the b-tree or B tree?
MySQL index with the b-tree or B tree?

Time:11-04

I see quite many people blog with B + tree, but I watch the document in the website, it only mentioned b-tree and hash, anyone know?

CodePudding user response:

reference 1/f, the breeze gently up response:
B the number of each node to store the real data, causes each node to store the data quantity is small, so the number of B layers will be relatively high, the maintenance cost is relatively large, and search and modify the lower performance,
B + tree node within only key values, relative to character, the record of a node is stored within the number of a lot more than B tree and
friend, alchemists in water reply ah
  • Related