Database management systems notes

B+ Trees

The structure behind almost every index, and what actually happens on insert. Every section is a drawn page beside a clear written explanation, about 22 minutes in all.

  • Chapter 19 of 34
  • About 22 minutes
  • 7 sections

Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.

The first drawn page of B+ Trees: Why not a binary search tree
The chapter's first page: Why not a binary search tree

In this chapter

  • Why not a binary search tree
  • The structure
  • Searching
  • Insertion, and the split
  • What an index costs on writes
  • Composite indexes and the leftmost prefix
  • Seeing the tree

Next chapters

Read the whole chapter

Sign in and the chapter opens with every drawn page, and all 35 database management systems chapters beside it.

DSA comes with the all labs plan and every ChaiCode batch.