0% completed
Partitioning Methods
Designing an effective partitioning scheme can be challenging and requires careful consideration of the application requirements and the characteristics of the data being processed. Below are three of the most popular schemes used by various large-scale applications.
a. Horizontal Partitioning
Also known as sharding, horizontal data partitioning involves dividing a database table into multiple partitions or shards, with each partition containing a subset of rows
.....
.....
.....
rakeshmmmec
· 3 years ago
There are any way/factor that decide we go for data partitioning rather than indexing
puneetmishra545
· 5 months ago
I understand in vertical partitioning, a single row is split into multiple shards. However, just curious to know how it can reduce the scan time? I mean ultimately you are scanning all the rows isn’t it? Can someone clarify more on this?
Abdullah
· 2 years ago
I mean the example makes it look like how any regular relational db would look like, different tables related via foreign keys