1 views collected around this technical thread.
This article combines a Meituan salary update with detailed explanations of MySQL indexing strategies, B‑tree variations, ACID transaction properties, isolation levels, caching, handling high‑traffic queries, the Raft consensus algorithm, and an overview of gRPC, providing comprehensive backend development knowledge for interview preparation.
This article explores how to build fault‑tolerant distributed systems by formalizing consensus, outlines its core properties, explains the FLP impossibility theorem, and shows how algorithms like Raft sidestep its limits through timing constraints and recovery mechanisms.
This article objectively compares NewSQL distributed databases with traditional middleware‑based sharding, examining their architectural advantages, distributed transaction handling, high‑availability mechanisms, scaling and sharding strategies, storage engine differences, ecosystem maturity, and provides guidance on selecting the appropriate solution for various workloads.
This article presents a comprehensive overview of the Berserker big‑data platform, detailing its overall design, data‑development components, key architectural challenges such as state management, release processes, two‑phase commit, RPC duplication, task routing, message handling, execution isolation, dependency model redesign, and outlines future work including stateless execution nodes, Kubernetes integration, and unified stream‑batch processing.
This article examines high‑concurrency distributed consistency algorithms—explaining the CAP challenges, detailing Paxos, Raft, and ZAB’s core concepts, roles, and workflow, and discussing their practical applications and selection criteria for ensuring strong data consistency in critical systems.
This article explains the principles, roles, phases, and typical application scenarios of four major distributed consensus algorithms—Paxos, Raft, ZAB, and Gossip—while also offering promotional material for extensive architecture and interview resources.
This article provides a comprehensive overview of Apache RocketMQ, detailing its core components, producer and consumer workflows, storage strategies, master‑slave synchronization, Raft‑based half‑write and leader election mechanisms, and best‑practice recommendations for high‑throughput, fault‑tolerant messaging systems.
This article provides a comprehensive tutorial on adding log snapshotting (snapshotting) to a Raft‑based distributed key‑value store, explaining the motivation, the snapshot mechanism, and detailed Go code for generating, transferring, applying, and persisting snapshots to reduce log size and improve performance.
This article explains the high‑availability architecture of TuGraph‑DB, covering the concepts of HA, the Raft consensus algorithm, cluster design, server and client mechanisms, snapshot handling, and future roadmap such as witness nodes and on‑demand snapshots.
The article explains why traditional MySQL sharding is discouraged, introduces the distributed database TiDB, details its architecture, core capabilities such as HTAP and Raft‑based consistency, compares feature support and resource usage with MySQL, and presents benchmark results demonstrating TiDB’s advantages at large scale.
This article explains the Raft consensus algorithm, its request lifecycle, leader election, snapshot mechanism, and JRaft optimizations such as linear reads, learners, and multi‑raft groups, illustrating how Nacos integrates these concepts to achieve reliable distributed consistency.
Distributed leader election ensures a single node performs exclusive tasks in high‑availability systems, with common implementations like Etcd, Kafka, Elasticsearch, and Zookeeper using algorithms such as Paxos, Raft, and ZAB, while Kubernetes provides the Lease resource to manage leader election via a distributed lock.
This article introduces the distributed transactional KV store TiKV, explains its role as TiDB’s storage engine, details its multi‑layered architecture and Raft‑based consistency model, and discusses the performance and resource challenges encountered at massive data scales along with the engineering solutions implemented to address them.
Curve is a high‑performance, easy‑to‑operate, cloud‑native open‑source distributed storage system (CNCF Sandbox) that provides block and file storage for OpenStack, Kubernetes, and PolarFS, featuring Raft‑based consistency, hybrid storage, high availability, and an ongoing roadmap for AI and other workloads.
This article provides a step‑by‑step guide to deploying a Nacos cluster on Linux, covering environment preparation, installation, MySQL configuration, application.properties settings, and cluster.conf setup, startup commands, and explains the Raft‑based leader election and data synchronization mechanisms for reliable microservice registration.
This article provides a comprehensive tutorial on setting up a Nacos cluster on Linux, covering environment preparation, database configuration, application property tuning, cluster file creation, startup procedures, microservice integration, and an in‑depth explanation of the Raft‑based leader election and data synchronization mechanisms.
This article explains the Raft consensus algorithm, detailing its roles, leader election process, term management, fault handling, and how it ensures consistency in both single‑node and multi‑node distributed systems for modern cloud‑native applications.
RaftKeeper is an open‑source, C++‑implemented Raft‑based distributed consensus service that offers double‑the‑throughput, sub‑second latency, five‑nines availability, and full ZooKeeper compatibility, targeting high‑performance OLAP workloads and large‑scale backend scenarios.
This article explains the Byzantine Generals problem, its fault‑tolerance limits, and how the Raft consensus algorithm solves a simplified version of the problem through leader election, log replication, and safety mechanisms, while also comparing Raft with Paxos, ZAB, and PBFT and providing Go code examples.
This article presents the background, overall architecture, partitioning strategies, raft‑based replication, binlog support, multi‑active deployment, bulk‑load mechanisms, storage‑engine optimizations, load‑balancing policies, and failure‑detection & recovery techniques of a high‑reliability, high‑throughput key‑value store used at Bilibili.