Optimizing B+Tree Performance with Contiguous Memory Layouts
On database building blocks.
Read the full articleYou might also wanna read
Building Faster Parsers Through Data-Oriented Design: Flat Arrays Over Pointer Trees
How designing the data structure first (flat arrays of indices instead of a pointer tree) makes a parser fast and collapses memory layout, a
arshad.fyi·18d ago
Buffer Pools, Caches, and the Memory Hierarchy
## Query Engine Optimization - Table of Contents 1. [How Query Engines Think: The Tradeoffs Behind Every Data System](/posts/2026-04-29-quer
iceberglakehouse.com·2mo ago
Engineers Detail Technical Hurdles of Rewriting PostgreSQL Database Engine in Rust
Developers attempting to rewrite PostgreSQL in Rust have documented significant technical challenges, including a 12–15% CPU overhead introd
ShortSingh·6d ago
B-Trees, LSM Trees, and the Indexing Tradeoff Spectrum
## Query Engine Optimization - Table of Contents 1. [How Query Engines Think: The Tradeoffs Behind Every Data System](/posts/2026-04-29-quer
iceberglakehouse.com·2mo ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.