14 min read
1
Paper Notes: WiscKey – Separating Keys from Values in SSD-conscious Storage
During the last post about LSM trees, we discussed how awesome they are for write-heavy storage engines. But we also…
Latest Posts
5 min read
4
LSM Tree: Data structure powering write heavy storage engines
A database system is built by gluing together multiple pieces of technology. One such piece is a storage engine which…
10 min read
1
Paper Notes: Zookeeper – Wait-free coordination for Internet-scale systems
In a distributed computing environment, servers often need to work with certain shared set of attributes such as locks, system…
12 min read
0
Paper Notes: Dynamo – Amazon’s Highly Available Key-value Store
Dynamo is one of the most influential papers in the domain of distributed storage technologies. It has inspired multiple open…
5 min read
1
Sloppy Quorum and Hinted handoff: Quorum in the times of failure
As part of a blog post in the past, we discussed how Quorums play a huge part in multi-node system.…
6 min read
2
Vector Clocks: Keeping time in check
“Lost time is never found again.” – Benjamin Franklin. The above quote is true to its core in context of…
8 min read
0
Implementing Raft consensus algorithm in Go
As part of my next post, I was looking to review the paper for Raft consensus algorithm. But this is…
10 min read
0
Paper Notes: Cassandra- A Decentralized Structured Storage System
Cassandra is a distributed storage system that focusses on providing a highly scalable & available service for storing very large…
6 min read
0
Paper Notes: Kafka – a Distributed Messaging System for Log Processing
Kafka was developed at LinkedIn for collecting & delivering high volume of log data with low latency. The paper dives…
11 min read
0
Paper Notes: Scaling Memcache at Facebook
As part of this post we will be looking into the paper Scaling memcache at Facebook and try to understand…