Sign inSign in
ConceptSystems & CS

B-tree

A B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time, optimized for systems that read and write large blocks of data.
as Victor Costan defines itMITThe wording closest to all 6 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • David J. Malan

    Harvard University · Introductory

    A short, fat tree data structure where each node can have many children, used to keep search paths in a database shallow.
  • D. Richard Hipp

    Carnegie Mellon University · Undergraduate

    A self-balancing tree data structure used for tables with 64-bit integer keys where all actual data is stored in the leaf nodes.
    • 38:25The Architecture and Bytecode Virtual Machine of SQLite
  • Andy Pavlo

    Carnegie Mellon University · Undergraduate

    A self-balancing, ordered tree structure that allows searches, sequential access, insertions, and deletions in logarithmic time.
  • Delaney Gillilan

    Griffin Financial Technology · Undergraduate

    A self-balancing tree data structure that keeps data sorted and allows efficient insertions, deletions, and searches for read-heavy workloads.
    • 35:10Porting Ideas, Not Code: Reimagining Clojure and Datomic Concepts in a Language-Agnostic Data Platform
  • Erik Demaine & Srini Devadas

    MIT · Undergraduate

    A self-balancing search tree in which nodes can have more than two children and multiple keys, designed to optimize disk reads.
    • 0:23R2. 2-3 Trees and B-Trees

Lectures that assume it

13

The first 12 are shown.

Connections

28

The lectures that define it or assume it, and the concepts next to it.

6 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.