← Thursday, October 15, 2026DatabasesDeep dive

InnoDB row storage favors point reads while indexes add write cost

marcpaul.io 15 min read Editor score 6/10

The comparison explains that InnoDB stores rows together, making selective reads efficient, while each B-tree index adds work to writes; it also introduces undo logs for concurrent reads and writes. These trade-offs help engineers reason about OLTP and OLAP workload choices.

What

• InnoDB stores rows together, uses B-tree indexes, and uses undo logs and MVCC to support concurrent reads and writes.

How

• Point reads can fetch a row from one disk location, while each index adds write work; MVCC lets reads access older row versions during updates.

Why it matters

• These trade-offs help engineers choose storage layouts and indexes based on read selectivity, write volume and concurrency needs.

Read on marcpaul.io → Hacker News · 9 comments

Headline, summary, brief and diagram are written by a model from the source's own text; the link, byline and numbers come from the source. Read the original before relying on a claim.