Exploring Persistence and Durability in Key-Value Databases
By
jtregunna
10mo ago· 8 min readenOpinion
100/100
Golden Brown
Bagelometer↗
Pulled from the oven just right. Trustworthy, fact-dense, deeply satisfying.
Score100TypeopinionSentimentneutral
Summary
The article discusses the author's experience working on a key-value database, exploring different approaches for persistence and durability. They compare the performance of using a hash table in memory with an append-only log and the classic fsync() call. The author hints at a new approach in a project called Klay, which will be open-sourced in the future.
Key quotes
· 3 pulledI started with the basics: A hash table in memory, a simple append-only log for persistence and durability, and the classic fsync() call after every write to the log for durability.
What would a database look like if you treated the indiv
In Kevo, that's the approach I use, but in Klay (not public yet, but will be open sourced when ready), I'm taking a different approach.
I've been working on a complex multi-model database for a few weeks now, and recently I took time to simplify and test out an idea I had on a simple key-value database. I started with the basics: A hash table in memory, a simple append-only log for persis
