The Coder Cafe

The Coder Cafe

Home
Concepts
The Coding Corner
Lattes & Stories
Sponsorships
📌 Index
💬 Discord

Distributed Systems

Build Your Own Key-Value Storage Engine—Week 2
LSM Tree Foundations
 • 
Teiva Harsanyi
Build Your Own Key-Value Storage Engine—Week 1
In-Memory Store
 • 
Teiva Harsanyi
Build Your Own Key-Value Storage Engine
Eight Weeks to a Working Key-Value Storage Engine
 • 
Teiva Harsanyi
Conflict-Free Replicated Data Types (CRDTs)
No matter when or how often the nodes sync, they always end up with the same state.
 • 
Teiva Harsanyi
Availability Models
Highly available is too vague; watch out when you read or hear it.
 • 
Teiva Harsanyi
Working on Complex Systems
This is why recognizing whether a system is complicated or complex is so important: it shapes how we should approach problem-solving.
 • 
Teiva Harsanyi
Bloom Filters
Bloom filters offer a space-efficient solution for checking set membership, trading accuracy for reduced memory usage.
 • 
Teiva Harsanyi
Probabilistic Increment
This problem here is called a hot row, and it occurs when a specific row in the database is modified frequently by multiple concurrent transactions.
 • 
Teiva Harsanyi
Exploring Database Isolation Levels
The higher the isolation level, the more anomalies are prevented—but it comes at a cost.
 • 
Teiva Harsanyi
Latency and User Experience
Sometimes, we can’t make things faster, but we can make them feel faster.
 • 
Teiva Harsanyi
Consensus
Consensus ensures that all nodes in a distributed system agree on the same value, even in the presence of failures or network partitions.
 • 
Teiva Harsanyi
Consistency Model
Stronger consistency models come with trade-offs: higher overhead and slower performance, while weaker consistency improves speed by tolerating…
 • 
Teiva Harsanyi
© 2025 Teiva Harsanyi
Start your SubstackGet the app
Substack is the home for great culture