✳flâneur — a map of the web's best reading

Prolly Trees | DoltHub Blog

dolthub.com · 2,942 words · saved by 1 readers

"Prolly Tree" is short for "Probabilistic B-tree". "Prolly Tree" was coined by the good folks who built Noms, who as far as we can tell invented the data structure. We here at DoltHub have immense respect for their pioneering work, without which Dolt would not exist. A Prolly Tree is a data structure closely related to a B-tree. Prolly Trees are generally useful but have proven particularly effective as the basis of the storage engine for version controlled databases. This article explains Prolly Trees in detail. Let's say you need a data structure with the following properties: A Prolly Tree delivers these properties. n: total leaf data in tree, k: average block size, w: window width As you can see a Prolly Tree approximates B-tree performance on reads and writes while also offering the ability to compute differences in time proportional to the size of differences rather than the total size of the data. Prolly Trees can also structurally share portions of the tree between versions due

“Prolly Tree” is short for “Probabilistic B-tree” . “Prolly Tree” was coined by the good folks who built Noms , who as far as we can tell invented the data structure. We here at DoltHub have immense respect for their pioneering work, without which Dolt would not exist. A Prolly Tree is a data structure closely related to a B-tree . Prolly Trees are generally useful but have proven particularly effective as the basis of the storage engine for version controlled databases . This article explains Prolly Trees in detail. Motivation # Let’s say you need a data structure with the following propertie

Explore this link on the map →

saved by

related reading