🐘 Postgres B-Tree index in 3D! 🌳
This is a dev post classified by AGK Intelligence as Databases (a free resource), kept by the Dev Radar because it carries real work, not commentary.
🐘 Postgres B-Tree index in 3D! 🌳 Ever wondered how PostgreSQL finds a single row among millions? 🚀 https://pgrun.dev/b-tree-index-postgres-3d Root → Internal nodes → Leaf - Millions of keys, just a few hops - Each node lives in an 8KB page - Built for incredibly fast lookups This is the magic happening behind your SQL queries. PostgreSQL internals are beautiful. 🐘
Posted by alex shapalov (3.8k followers) 1 h ago · 9 likes · 380 views · view the original post on X. Kept by the Dev Radar as Databases. Tools mentioned: PostgreSQL B-Tree Index in 3D.
More dev work like this
- Agents can build software. But what about the databases behind it? — @databricks
- Let’s welcome Neon to the conference as an Emerald sponsor. — @sfrubyconf
- Redis OSS 8.2 is now available as a Redis-published AMI on AWS Marketplace, so your… — @Redisinc
- “The bigger risk I face isn’t that you’re going to fail and we’re going to get rid of… — @ClickHouseDB
- storage lookups got up to 1.9x faster on tpuf v3 using cascading binary search — @turbopuffer
- How do you ship fast while not breaking the database? — @BenjDicken
- “Half the time, Neon would just not work.” — @ClickHouseDB
- RAG has evolved from simple vector search to AI agents that decide how to retrieve… — @SCR01111
Every post is read and classified by AGK Intelligence: what it is, which market it belongs to, and whether the link is a real tool. 31.8k posts from 5k X accounts over the last 21 days, 9.5k tools, 12 markets. New posts are collected several times an hour and the full ranking is recomputed every hour — last update 2026-11-06 20:43 UTC. Full method.