Ben

@benjdd.com

databases @planetscale.com Some stuff I've written: - https://pscale.link/io - https://pscale.link/btrees - https://pscale.link/sharding Find me at benjdd.com

You're probably sick of me saying "B-tree" but these impact SO MUCH of database performance. They're used all over the place in Postgres, MySQL, and SQLite. This week I broke down B-tree lookups and how the page cache makes lookups faster.

If databases fascinate you like they do me, this article's for you! Every time you interact with a website, database transactions are keeping your data consistent, safe, and isolated. I wrote an interactive guide to how they work ⬇️

Tuning your database just right can be counter-intuitive, unless you understand all levels of the system. Intuitively, most would say "more work_mem = better" for building indexes, but this hurts performance due to L3 cache behavior. Great article by Tomas Vondra. vondra.me/posts/dont-g...

Bild

R-trees are a powerful structure for indexing geometric data. They’re used by MySQL, and Postgres uses an R-tree-like structure via GiST in PostGIS. 🧵

Bild

I'm excited about the database performance io_uring will unlock. Last year I benchmarked Postgres 17 vs 18 to test the initial io_uring upgrades. I was surprised to see they weren't always a clear win for TPC-C. This paper studies the potential, and the future looks good.

Bild

Software at scale reveals the cracks. Managing a system for a single use-case (databases or otherwise) can make it seem like a perfect solution. It just might be for that narrow environment! At scale you see all the edge cases because you're operating on so many workloads.

What do Git, Cursor, and Dynamo have in common? Merkle trees! A great data structure for tracking file changes, facilitating incremental sync with remote servers. Say we want to track changes to a codebase at a per-file level. We compute a hash for each source file, and these become leaf nodes.

Bild

Need a break from AI in the timeline? Listen to me talk about data organization instead :) Friday's stream was a fun one. Sequential writes, binary search trees, block I/O devices, and B-trees. The latest slice dropped this afternoon. www.youtube.com/watch?v=84b_...

Bild

If 2026 is the year of AI, it's also the year to read more papers. LLMs make writing code cheaper. This places greater emphasis on architectural choices, understanding design tradeoffs, ensuring security, and building things people actually need. Great example: yesterday I read the Dynamo paper.

Bild

2026 is the year to end TikTok brain. Instead, learn database internals on YouTube. Speaking of which, another dropped today (link below).

Bild

Cameras, lenses, framing, and everything in-between have fascinated me for many year. This morning I read Bartosz Ciechanowski's article on the subject. It's the best explainer I've seen. The interactivity really sells it. Great article to kick off your year with: ciechanow.ski/cameras-and-...

This is the best article I've read on MVCC in MySQL. MySQL and Postgres use quite different engineering techniques are used to address the same problem. Undo log vs multiple tuple versions. Another great one by Jeremy Cole. blog.jcole.us/2014/04/16/t...

Bild

Amazing how one simple idea can revolutionize an industry. Binary search trees were invented in 1960. It seems obvious today, but this was a fresh way of thinking about ordered data on computers.

pgcli and mycli are wonderful upgrades from the default psql / mysql database clients. Auto-completion, syntax highlighting, and just generally much better usability. If you're connecting to your DB from the terminal, get these asap.

UX and performance are tightly correlated. Don't treat them as distinct concerns. We've all used software that's slow and becomes a huge turnoff. Fast software makes for happy users. Or at least, avoids making them mad!

Goal: benchmark Postgres 8.0 - 18.0. That's 20 years of database performance! I haven't started beyond "planning with Claude," but I expect the hardest part to be building old versions from source. Much has changed in compilers + unix since 2005. Who's done this? Suggestions?

PSA to my Postgres people: use a connection pooler. Incredible article on when and why to use PgBouncer. Includes a great explanation of how increasing direct connections leads to more contention → degraded performance. (+ benchmarks too!)

Bild

Log structures are all over the place in databases, but did you know they are used in file systems too? This week I re-read the iconic LFS paper by Rosenblum / Ousterhout. The differences between I/O demands on a database vs a general-purpose FS are neat to study.

Bild

I present to you: the 8 LOC database. Who needs ACID, relational schema, foreign keys, B-tree indexes, log-based commits, MVCC, replication, and failovers? We've been overthinking the database. Keep it simple.

Bild

GIN indexes are a powerful tool in Postgres. They’re great for inverting the typical use case. Instead of mapping “the row with ID 2 contains ‘become a database expert’” you flip it to say “The word ‘database’ maps to the rows with IDs 1, 2, and 3 and ‘expert’ maps to the row with ID 2.”

Bild

Postgres, MySQL, SQLite and many others were invented in the 90s and 00s, the era of spinning disks. A local NVMe SSD has ~1000x improvement in both throughput and latency. If we had to throw these databases away and begin from scratch in 2025, what would change and what would remain?

4 months later, DDIA complete. All 12 chapters. Wonder how many people who post about this book have read the whole thing? Parting thoughts (in thread)

Bild