0 views collected around this technical thread.
This article explains the need for database sharding as applications scale, describes horizontal and vertical partitioning techniques, compares popular sharding middleware, and offers practical guidance on choosing and deploying sharding solutions for different workloads.
This article explains why database sharding (both vertical and horizontal) is needed to overcome performance bottlenecks, outlines practical thresholds for splitting tables, describes vertical and horizontal partitioning techniques, and discusses key issues such as distributed transactions, cross‑node queries, global primary keys, and scaling strategies.
This article explains the reasons for database sharding, compares vertical (scale‑up) and horizontal (scale‑out) partitioning methods, illustrates vertical database/table splits and horizontal partition strategies such as HASH, RANGE, LIST, KEY and composite, and discusses the challenges like distributed transactions, cross‑database joins and increased management overhead.
This article explains the concepts of database and table sharding, why they are needed, various vertical and horizontal splitting strategies, range and hash partitioning methods, their advantages and drawbacks, timing considerations, common challenges such as transactions and distributed IDs, and introduces popular sharding middleware.
Database sharding improves performance by partitioning tables vertically or horizontally and routing rows with consistent hashing, while ShardingJDBC rewrites SQL for physical tables, adds missing columns, corrects pagination, splits batch inserts, and merges results using sorting, grouping, aggregation, and pagination engines.
This article explains what database sharding (horizontal and vertical partitioning) is, why it is needed, the implementation strategies, and compares two popular solutions—Mycat middleware and Sharding-JDBC—highlighting their advantages, drawbacks, and typical use cases.
This article explains why and how to apply vertical (business‑oriented) and horizontal (data‑oriented) sharding, covering single‑database, table splitting, database splitting, combined sharding, read‑write separation, routing algorithms, and real‑world case studies to improve scalability and performance.
This article explains the concepts, characteristics, and practical scenarios of database sharding—including vertical and horizontal table partitioning as well as vertical and horizontal database partitioning—helping developers decide when and how to apply each strategy to improve scalability and performance.
This article explains the concepts, characteristics, and practical scenarios of vertical and horizontal table partitioning as well as vertical and horizontal database sharding in MySQL, helping developers decide when and how to apply each strategy for large‑scale applications.
This article explains how to decide between database and table sharding, describes vertical, horizontal, and range partitioning techniques, discusses their trade‑offs and implementation details, and offers practical guidance for solving query challenges in high‑traffic, write‑intensive systems.
The article explains MySQL vertical partitioning techniques—including instance‑level database splitting, schema‑level splitting, and column‑level table splitting—detailing their advantages, drawbacks, and step‑by‑step command‑line procedures with code examples for implementing each method in production environments.
This article explains the performance bottlenecks of relational databases, introduces sharding concepts such as horizontal, vertical, and table partitioning, discusses associated challenges like distributed transactions and global primary keys, and provides practical solutions and tool recommendations for implementing effective database partitioning.
This article examines common database performance bottlenecks such as I/O and CPU limits, explains the concepts, results, and scenarios of horizontal and vertical sharding—including database and table partitioning—and outlines tools, steps, and challenges for implementing effective sharding solutions.
This article analyzes common database performance bottlenecks such as I/O and CPU limits, explains how horizontal and vertical sharding (including database and table partitioning) can alleviate these issues, introduces practical tools and step‑by‑step implementation guidance, and discusses related challenges like non‑partition key queries and scaling.
This article explains MySQL performance bottlenecks, compares IO and CPU limits, introduces horizontal and vertical sharding and partitioning concepts, presents practical scenarios, outlines common tools such as Sharding‑Sphere, TDDL and Mycat, and provides step‑by‑step guidance for implementation, troubleshooting and scaling.
This article analyzes common database I/O and CPU bottlenecks, explains horizontal and vertical sharding concepts, presents practical sharding rules, discusses tooling such as Sharding‑Sphere, TDDL and Mycat, and outlines step‑by‑step procedures and common pitfalls for scaling relational databases.
This article explains why relational databases become bottlenecks at large scale, introduces vertical and horizontal sharding techniques, discusses the challenges of distributed transactions, cross‑shard queries, pagination, and global primary‑key generation, and provides practical guidelines and middleware options for implementing sharding in production systems.
This article explains the reasons for splitting databases, describes vertical and horizontal sharding techniques, compares their benefits and drawbacks, and advises performing horizontal sharding before vertical partitioning to improve scalability and performance in large‑scale applications.
The article explains how MySQL multi‑source replication can be employed to back up, horizontally or vertically partition, and merge data from several servers into a single target database, illustrating three typical scenarios and providing example SQL for data consolidation.
This article explains common database performance bottlenecks such as I/O and CPU limits, describes how horizontal and vertical sharding (both database and table level) can alleviate these issues, outlines practical tools, implementation steps, and addresses typical challenges like non‑partition key queries and scaling.