diff --git a/courses/databases_nosql/images/cluster_quorum.png b/courses/databases_nosql/images/cluster_quorum.png new file mode 100644 index 0000000..1091fb4 Binary files /dev/null and b/courses/databases_nosql/images/cluster_quorum.png differ diff --git a/courses/databases_nosql/key_concepts.md b/courses/databases_nosql/key_concepts.md index 78e99f7..8034b93 100644 --- a/courses/databases_nosql/key_concepts.md +++ b/courses/databases_nosql/key_concepts.md @@ -80,10 +80,10 @@ When the amount of data crosses the capacity of a single node, we need to think -
(Back to top)(Next alert)
>>>>>
- + ** Sharding example** @@ -120,10 +120,10 @@ Say that our hash function h() generates a 32-bit integer. Then, to determine to -
images\consistent_hashing.png
+- + Consistent hashing illustration @@ -168,10 +168,10 @@ In a 6 node cluster, you need 4 nodes for a majority. -
>>>>> gd2md-html alert: inline image link here (to images/image4.png). Store image on your image server and adjust path/filename/extension if necessary.
(Back to top)(Next alert)
>>>>>
- + Network problems can cause communication failures among cluster nodes. One set of nodes might be able to communicate together across a functioning part of a network but not be able to communicate with a different set of nodes in another part of the network. This is known as split brain in cluster or cluster partitioning. @@ -184,9 +184,9 @@ Below diagram demonstrates Quorum selection on a cluster partitioned into two se -
>>>>> gd2md-html alert: inline image link here (to images/image5.png). Store image on your image server and adjust path/filename/extension if necessary.
(Back to top)(Next alert)
>>>>>
- +