bbtree: fastest ordered map
How bbtree, a drop-in replacement for std's BTreeMap, cuts cache misses, instructions and cache coherence traffic, and how it is kept correct.
Topic
#database-internals
9 篇笔记
How OpenAI ingests petabytes of logs every day
In this blog we will see where OpenAI's logs go, and how one line of code saved its logging system. In June 2025, ClickHouse wrote about OpenAI's logs.
The Audit Log Page
An audit log has two readers. Most logs are designed for the wrong one. Five theses on product audit logs.
Building the last WAL on S3
Nearly two years ago, we started Archil with a simple realization: it was clear that people were spending immense effort to build new, serve...
wal3: A Write-Ahead Log for Chroma, Build on Object Storage
wal3, Chroma's write-ahead log, combining a 30-year-old lock-free algorithm with S3's newest conditional writes feature.
Concurrency vs. Throughput: why more parallelism can make databases slower
Increasing throughput sometimes requires reducing parallelism. A look into why this is the case for Vitess + MySQL databases
What is WAL backpressure, and why does ClickHouse Managed Postgres need it?
How ClickHouse Managed Postgres uses WAL-aware backpressure to slow client writes, protect disk space, and let the archiver recover.
protocols for transactional usage of object storage
building correct applications w/o external coordination
DuckDB Internals: Why is DuckDB Fast?
Walk through DuckDB's internals: how it skips serialization overhead, parses and optimizes SQL, and stores data in columnar row groups with zone maps.