Tag: B+Tree
2 articles
MySQL Index Principles: B+Tree, Hash, Binary Search
Index principles: B+Tree, Hash index, binary search, InnoDB adaptive hash index. This article provides in-depth analysis of principles and practical applications.
MongoDB vs MySQL: B-Tree vs B+Tree Index Mechanisms
MongoDB uses B-tree indexes where nodes store both data and keys. MySQL uses B+tree indexes with all data concentrated in leaf nodes. B+tree is better for range queries, B-tree is better for random...