B-TREE versus Row Heap. Which database has the better engine?

Name: B-TREE versus Row Heap. Which database has the better engine?
Uploaded: 2026-05-21T00:00:00.000Z
Duration: 13 min 47 s
Description: MySQL’s InnoDB stores each table as a clustered B+ tree whose leaf pages are the rows, while Postgres appends rows into an unordered heap and keeps a separate B-tree index that points at those heap tuples. The operati...

Ben Dicken · 13:47 · Watch on YouTube

MySQL’s InnoDB stores each table as a clustered B+ tree whose leaf pages are the rows, while Postgres appends rows into an unordered heap and keeps a separate B-tree index that points at those heap tuples. The operati...

Read the full summary on retube