B+ Trees
← Back to Self-Balancing Trees
Variant of B-Tree where all values are stored in leaf nodes, and leaf nodes are linked sequentially. Excellent for range queries. The dominant index structure in relational databases (Postgres, MySQL InnoDB).
← Back to Self-Balancing Trees
Variant of B-Tree where all values are stored in leaf nodes, and leaf nodes are linked sequentially. Excellent for range queries. The dominant index structure in relational databases (Postgres, MySQL InnoDB).