LSM Trees Unveiled - Part 2 - Efficient Rust Implementation
Welcome to Part 2 of our series on Log-Structured Merge (LSM) trees. In Part 1, we explored the core concepts and components of LSM trees. Now, we'll dive into an efficient
Haili Zhang
LSM Trees Unveiled - Part 1 - Core Concepts and Components
Log-Structured Merge (LSM) trees are a powerful data structure that underlies many modern database systems, including LevelDB, RocksDB, Cassandra, and ClickHouse's MergeTree engine. In this three-part blog series, we'll
Understanding the Gossip Protocol in Distributed Systems
Introduction
In the world of distributed systems, maintaining consistency and reliability across multiple nodes is a significant challenge. One elegant solution to this problem is the Gossip Protocol. In this blog post, we&
Data Sketches: Efficient Algorithms for Big Data Analysis
In the era of big data, processing and analyzing massive datasets has become a significant challenge. Traditional algorithms often struggle with the sheer volume of information, leading to impractical computation times and excessive
Rusty Circuit Breaker 🦀
In this blog, let us have fun implementing a software wheel, Circuit Breaker, in Rust.
What is Circuit Breaker?
I've talked about Circuit Breaker in one of my previous posts, Microservice