B-trees

Balanced trees with wide nodes that keep data sorted on disk, giving logarithmic lookups and range scans. They are the storage engine of most relational databases and are read-optimised.

Advanced
Data and storage

See it break, then fix it

Build an architecture, send it a day of traffic and outages, and learn why it holds or fails. Free to start.

Open the learning path Open the sandbox