Skip to main content

B-Tree Indexes

Learn B-Tree Indexes (Indexes, MySQL) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Introduction MySQL InnoDB indexes are B+Trees : a balanced, sorted tree where internal nodes hold keys and leaf nodes hold all entries, chained left-to-right in a doubly linked list. Each node is a 16 KB page, so the tree is very wide and very shallow.

More lessons in Indexes