Transactional

If you can ctrl-c and ctrl-v, you can build a JIT.

Clang optimizations.

A NULL BITMAP guest post on loop parallelism transformations.

Every transactional system must execute, order, validate, and persist transactions.

There's better ways to replicate data than Raft.

Aurora, Socrates, PolarDB, and Taurus.

Filesystems, file IO, and durability.

An overview of erasure coding, its trade-offs, and applications in distributed storage systems.

Consistent replication algorithms can be placed on a sliding scale based on how they handle replica failures.

Welcome to the B-Tree tutorial.

Support for searching down the tree in search of a single value.

Opening and closing databases as a BerkeleyDB ABI-compatible library.

Our next goal is to be able to walk the tree, and print out the values stored in the B-Tree.

Support for parsing and printing information contained in the header for BerkeleyDB pages.

The background and context on why the groupings exist the way they do, and thedifferent sorts of pages you’ll find in this section.

Paxos, Raft, and all their flavors, variations, and alternatives.

A reminder that macOS does not respect the usual ways of making data durable on disk.

When application code provides high-level fault injection points, fuzzing becomes significantly more effective.