✳flâneur — a map of the web's best reading
How Dolt Stores Table Data | DoltHub Blog
dolthub.com · 1,893 words · saved by 1 readers
Blog for DoltHub, a website hosting databases made with Dolt, an open-source version-controlled SQL database with Git-like semantics.
Dolt is Git for data . It’s a SQL database that lets you clone, branch, diff, merge, and fork your data just like you can with a filesystem tree in Git. This blog post explores one of the fundamental datastructures that underlies Dolt’s implementation of SQL tables. What We Need # Dolt currently supports a subset of SQL where every table must have a primary key. The SQL layer is implemented on top of a table storage layer that models a key-value store, where keys and values are both byte arrays. To efficiently implement the Git for data portions of Dolt , we need certain unique properties from
Explore this link on the map →related reading
- Prolly Trees | DoltHub Blogdolthub.com
- Merklizing the key/value store for fun and profit | Joel Gustafsonjoelgustafson.com
- Build Your Own Databasenan.fyi
- How Cursor Indexes Codebases Fast - by Engineer's Codexread.engineerscodex.com
- Notionnanransohoff.com
- Merkle Tree | Brilliant Math & Science Wikibrilliant.org
- Database Fundamentalstontinton.com
- A More Human Approach To Databasesccorcos.github.io
- CRDTs go brrrjosephg.com
- CRDT optimizationsbartoszsypytkowski.com
- Peer-to-Peer Ordered Search Indexes – 0 FPS0fps.net
- Cleaned-up transcript of Rich Hickey's talk "Deconstructing the Database" · GitHubgist.github.com