Each series here picks one database and follows a transaction through it — from the moment it starts to the moment its writes become readable — so the components are introduced by what they do, not by their names.

Resolver v3: a temporal B+ tree for FoundationDB's conflict history, from routing to reclamation
FoundationDB rejects a transaction once its read version is more than five seconds old because the resolver keeps only that much write history. Resolver v3 replaces that history with a temporal B+ tree under a memory budget and processes each batch in two phases: one descent routes every read and write begin together and checks the reads, then the accepted writes are applied in key order by cooperative tasks that search and prefetch ahead of a single writer. Under the same 6 GiB budget, final v3 retains 582.9–584.7 seconds of conflict history in the measured tail—2.20× FoundationDB’s calibrated 265-second window. The 5,400-second trace replays in 0.77× FoundationDB’s time on Intel and 0.94× on AMD, each the median of two opposite-order pairs, with every decision and the same retention curve on both machines. Every published v3 performance run verifies that the complete pool is in HugeTLB pages.


