Timeline for Does mysql use B-tree,B+tree or both?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2018 at 18:14 | comment | added | Rick James |
@FedericoRazzoli - I'm pretty sure MEMORY used to have only HASH indexes; BTree (B+Tree??) was added later.
|
|
| May 7, 2018 at 18:10 | comment | added | Rick James | MyISAM had BTree indexes that were not B+Trees. In that engine, it was less practical to implement B+Trees, and BTree was quick-and-dirty (but still very useful) -- the general philosophy of MyISAM two decades ago. | |
| Apr 26, 2018 at 21:03 | comment | added | Federico Razzoli | I believe that the article is simply wrong. For sure it is wrong when it says that MEMORY uses both HASH and BTREE: it only supports HASH. | |
| Apr 26, 2018 at 21:01 | comment | added | Federico Razzoli | It is possible that MyISAM uses B-Trees, but it would be weird. Other engines don't, imo. But I think I answered about the difference: ORDER BY and GROUP BY take advantage of B+Tree. | |
| Apr 20, 2018 at 22:39 | comment | added | Noussa Smiley | thank you for your answer, but you didn't comment on the link I gave, it said that Mysql uses both B-tree and B+tree, so does it mean that there are other engines that use B-tree, cause so far the one I looked up use B+tree, unless I got things wrong. And what I meant by difference between the two is; if there are queries that are executed faster when the | |
| Apr 20, 2018 at 22:21 | comment | added | Noussa Smiley | thank you for the explanation, but you didn't comment on what they said in the article(that Mysql uses both ) are they perhaps talking about other engines that might be using B-tree, do you know any that use B-trees. I really need to make a B-tree index and another B+tree to see the difference in speed between the two. | |
| Apr 20, 2018 at 22:14 | vote | accept | Noussa Smiley | ||
| Apr 20, 2018 at 21:10 | history | answered | Federico Razzoli | CC BY-SA 3.0 |