M1Single-journal commit
The team rejected two-phase commit, which spreads rows over many journals and needs a coordinator. That design adds lock sequences, timeouts, liveness checks, rollbacks, and coordinator failure handling. DSQL writes each commit to one journal instead. This keeps atomicity and durability simple and lets write capacity grow when the team adds journals.
The cost moves to reads, because a reader must check every journal for the latest value of a row. Adding more journals eventually reaches network bandwidth limits.
M2Crossbar
The crossbar separates read scaling from write scaling. Each journal is ordered by transaction time, and the crossbar merges all journals into one ordered stream. Storage nodes ask for key ranges and receive only the matching updates. Every layer fans out widely to use hardware well.
Slow subscribers force the crossbar to buffer data, and this raises garbage collection load.
M3Tail latency simulation
The team simulated a crossbar with 40 hosts where each host sometimes stalled for one second. The model predicted about 1 million TPS. The simulation reached about 6,000 TPS. Tail latency grew from an acceptable one second to about ten seconds.
Each transaction reads from many hosts, so the chance that at least one host pauses nears 100 percent at scale.
M4Adjudicator as the first Rust component
The team picked the adjudicator because it is simpler than the crossbar. A Rust journal client already existed, and a Kotlin version gave a fair comparison. Two engineers who were new to C, C++, and Rust wrote the Rust version. The Kotlin version, tuned over years, reached 2,000 to 3,000 TPS.
The untuned Rust version reached about 30,000 TPS. After this result the team rewrote the whole data plane in Rust.
M5Postgres extension strategy
DSQL keeps the Postgres parser and planner. It replaces replication, concurrency control, durability, storage, and session transaction handling. The team used the public Postgres extension API so the code stays close to upstream. The first extensions used C.
A code review found several memory-safety bugs in one simple data structure, so the team moved to Rust. In Rust, one type can wrap a pointer and its length together. That type enforces the rule that links them.