If you have worked with distributed systems, you must have come across this famous quote In a distributed system, the only thing two nodes can agree on is that they can't agree on anything. This quote has stuck with me because it perfectly captures the complexity of building distributed systems...
This is a follow up article to [this](https://gauravsarma. com/posts/snapshotting-in-a-high-throughput-shared-nothing-database/) post that I wrote about comparing Copy on Write and Redirect on Write mechanisms...
While browsing Twitter (it will never be X. com for me), I came across a tweet where it was being discussed how an engineer from a big tech company was unable to explain how async/await works after working on a particular language for 3+ years...
Snapshotting in a high throughput shared-nothing database While working on a Golang based in-memory database, I recently had to implement point in time snapshots for the datastore. The in-memory database has a shared nothing architecture allowing it to run multiple goroutines, usually based on the number of available cores and the keys are allocated accordingly to the shard goroutines...
I have been writing on Medium for more than 5 years on various technology topics. I have finally decided to switch from Medium to a self hosted setup...
In the realm of database management systems, the ability to handle concurrent transactions efficiently is paramount. As applications demand higher performance and seamless user experiences, traditional locking mechanisms often fall short, leading to bottlenecks and reduced throughput...
Problems with a global lock space I was recently working on an in-memory datastore which had a flat layout of the underlying data structure. The datastore contained key value pairs, similar to a hash...