storage lookups got up to 1.9x faster on tpuf v3 using cascading binary search
This is a dev post classified by AGK Intelligence as Databases (a tutorial), kept by the Dev Radar because it carries real work, not commentary.
storage lookups got up to 1.9x faster on tpuf v3 using cascading binary search v3 keys rows on 3 columns (a, b, c). lookups inefficiently compared all 3 during each search step now we cascade: search a, then b, then c, narrowing the search range as we go
Posted by turbopuffer (17.8k followers) 1 h ago · 26 likes · 1.3k views · view the original post on X. Kept by the Dev Radar as Databases.
More dev work like this
- 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
- How @jetbrains Built Cross-Database Queries into DataGrip with DuckDB 🧠 🦆 — @duckdb
- The old writer comes back. — @siddontang
- Introduction to SQL by Bobby Iliev (2020) is now in @ChapterPal's collection of open… — @burkov
- Use LLMs to Turn CSVs into Knowledge Graph! #BigData #Analytics #DataScience #AI… — @gp_pulipaka
- Developers can use MongoDB as the persistent memory store for applications and agents… — @MongoDB
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 17:41 UTC. Full method.