Version-controlled databases using Prolly trees
Summary
Version-controlled databases using Prolly trees explains Dolt's approach to versioning databases via prolly trees, a variant of B-trees that allows identical trees for the same content. It covers the data structures, how Prolly trees enable cheap diffs, snapshots, and branching, and discusses trade-offs like storage overhead and hash-based boundary decisions. The piece also provides historical context and potential future applications beyond databases.