B-TREE versus Row Heap. Which database has the better engine?
MySQL's InnoDB stores table data directly in a clustered index (B+tree ordered by primary key), making primary key lookups fast but secondary indexes slower (requiring a bookmark lookup). PostgreSQL uses heap files with unordered rows; all indexes are secondary and equal, simplifying writes but requiring more index maintenance for reads.
----
Welcome to the channel! I make videos about software engineering, databases, and distributed systems. You can find more about me at the links below:
X: https://x.com/BenjDicken
LinkedIn: / benjdicken
Web: http://benjdd.com/