B-Tree vs B+Tree in Production DBMS (Members)
B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. However, most contents explain this data structure from a theoretical point of view, in this lecture I’d like to shed some light on the practical considerations of B-Tree and B+Trees in real production database systems such as Postgres and MySQL.
0:00 Introduction & Agenda
1:00 Agenda
3:35 Full Table Scan
6:53 Original B-Tree
11:33 How Original B-Tree helps Performance
19:20 Limitation of B-Tree
25:46 B+Tree
32:00 B+Tree DBMS Considerations
36:20 B+Tree Storage Cost in MySQL vs Postgres
40:00 Summary
Save
Share
Tweet
