All news

MirrorBtr speeds up B-Tree traversals in MySQL InnoDB by adding a learned index alongside the tree instead of replacing it, so transactions and recovery stay untouched while lookups skip most inner nodes.

PRISM is an integer set structure that splits 64-bit keys into prefix segments in a trie with bitmap nodes, pruning whole key ranges during intersection and mapping leaves onto SIMD registers for fast k-way intersection.

pgEdge digs into Postgres numeric internals to explain why aggregates over numeric are much slower than over integer or float types, and what could make them faster.

Part 2 of how OpenAI scaled its storage platform Habitat to serve over 1 billion ChatGPT users across 40 regions with millisecond latency.

Shard keys should come from your access patterns, not your tables: co-locating orders with customers by customer_id avoids cross-shard joins in sharded Postgres.

Explains why UUIDv7 values are not strictly time-ordered in practice and other surprising quirks that matter for database keys.