BestHub
Sign in
Tagged articles
6 articles
Page 1 of 1
ITPUB
ITPUB
Jan 4, 2023 · Databases

Can Cassandra Beat RDBMS Distributed Bottlenecks? A Deep Dive into Decentralized Databases

The article traces the evolution from Codd's relational model to modern RDBMS scaling limits, explains why centralized Hadoop/HBase architectures struggle with high‑concurrency workloads, and shows how Cassandra’s decentralized design—using consistent hashing, gossip, and virtual nodes—overcomes these bottlenecks while offering flexible consistency guarantees.

ConsistencyHBaseHDFS
0 likes · 22 min read
Can Cassandra Beat RDBMS Distributed Bottlenecks? A Deep Dive into Decentralized Databases
Top Architect
Top Architect
Oct 10, 2022 · Databases

Designing Routing Keys for Sharding in an Order Platform

This article explains how to select and implement routing keys for database sharding in a food‑delivery order system, covering supported scenarios, single‑ and multi‑database strategies, hash‑based distribution for both user and merchant data, and practical flow diagrams to ensure balanced and efficient data access.

BackendDatabase designHash Partitioning
0 likes · 5 min read
Designing Routing Keys for Sharding in an Order Platform
Top Architect
Top Architect
Oct 7, 2022 · Databases

Designing Routing Keys for Sharding in an Order Platform

The article explains how to choose and implement routing keys after database sharding for an online food ordering system, covering supported scenarios, hash‑based routing strategies for both user and merchant sides, multi‑database/table selection, and practical data‑flow diagrams.

Database designHash PartitioningRouting Key
0 likes · 6 min read
Designing Routing Keys for Sharding in an Order Platform
Architecture Digest
Architecture Digest
Feb 15, 2018 · Databases

Design and Architecture of Zeppelin Distributed Block Storage System

This article presents an in‑depth overview of Zeppelin, a high‑availability, high‑performance block storage service, covering its motivation, online vs offline storage distinctions, data distribution strategies, centralized meta‑server design, replication policies, RocksDB‑based storage engine, Raft‑based consistency protocol, threading model, client request flow, and fault‑handling mechanisms.

Hash PartitioningRaftReplication
0 likes · 19 min read
Design and Architecture of Zeppelin Distributed Block Storage System
MaGe Linux Operations
MaGe Linux Operations
May 4, 2017 · Big Data

How to Process 100GB Logs and Massive Datasets with Hash Partitioning and Bloom Filters

This article explains the definition and 4V characteristics of big data and presents practical algorithms—including hash partitioning, min‑heap top‑K selection, bitmap extensions, and Bloom filter techniques—to efficiently handle ultra‑large log files, integer sets, and keyword searches within strict memory limits.

Big DataBitmapHash Partitioning
0 likes · 12 min read
How to Process 100GB Logs and Massive Datasets with Hash Partitioning and Bloom Filters