Inside an index: B-trees, B+trees, clustered tables, heaps and choosing a primary key
Why databases use B+trees, how an InnoDB clustered index differs from a PostgreSQL heap, how unique indexes treat NULL, composite indexes with range predicates, bigint vs UUIDv4 vs UUIDv7 as a primary key, and maintaining indexes once they bloat.