You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+5-5Lines changed: 5 additions & 5 deletions
Original file line number
Diff line number
Diff line change
@@ -1797,11 +1797,11 @@ But why do we need sharding? Here are some advantages:
1797
1797
1798
1798
-**Complexity**: Sharding increases the complexity of the system in general.
1799
1799
-**Joins across shards**: Once a database is partitioned and spread across multiple machines it is often not feasible to perform joins that span multiple database shards. Such joins will not be performance efficient since data has to be retrieved from multiple servers.
1800
-
-**Rebalancing**: If the data distribution is not uniform or there is a lot of load on a single shard, in such cases we have to rebalance our shards so that the requests are as equally distributed among the shards as possible.
1800
+
-**Rebalancing**: If the data distribution is not uniform or there is a lot of load on a single shard, in such cases, we have to rebalance our shards so that the requests are as equally distributed among the shards as possible.
1801
1801
1802
1802
## When to use sharding?
1803
1803
1804
-
Here are some reasons where sharding might be the right choice:
1804
+
Here are some reasons why sharding might be the right choice:
1805
1805
1806
1806
- Leveraging existing hardware instead of high-end machines.
1807
1807
- Maintain data in distinct geographic regions.
@@ -1925,7 +1925,7 @@ Where,
1925
1925
1926
1926
As VNodes help spread the load more evenly across the physical nodes on the cluster by diving the hash ranges into smaller subranges, this speeds up the re-balancing process after adding or removing nodes. This also helps us reduce the probability of hotspots.
1927
1927
1928
-
## Data replication
1928
+
## Data Replication
1929
1929
1930
1930
To ensure high availability and durability, consistent hashing replicates each data item on multiple `N` nodes in the system where the value `N` is equivalent to the _replication factor_.
1931
1931
@@ -2221,7 +2221,7 @@ Message topics authenticate applications that try to publish content, this allow
2221
2221
2222
2222
## Examples
2223
2223
2224
-
Here are some technologies commonly used for publish-subscribe:
2224
+
Here are some commonly used publish-subscribe technologies:
@@ -2287,7 +2287,7 @@ Some common disadvantages of monoliths are:
2287
2287
- Reduced reliability as a single bug can bring down the entire system.
2288
2288
- Difficult to scale or adopt new technologies.
2289
2289
2290
-
## Modular monoliths
2290
+
## Modular Monoliths
2291
2291
2292
2292
A Modular Monolith is an approach where we build and deploy a single application (that's the _Monolith_ part), but we build it in a way that breaks up the code into independent modules for each of the features needed in our application.
0 commit comments