1. 程式人生 > >CAP理論與HBase

CAP理論與HBase

The short summary of the article is that CAP isn’t “C, A, or P, choose
two,” but rather “When P happens, choose A or C.”

Partitions, like death and taxes, are unavoidable – think of machine
death as just a partition of that machine out into the networking
equivalent of the afterlife. So it’s up to the system designer to
decide if, when that happens, we give up availability or give up
consistency.

In HBase’s case we choose consistency, so we have to give up some availability. 這個理解CAP,太到位了

本文的簡短總結是,CAP是不是“C,A,或P,選擇
二,“而是”在P情況,選擇A或C.“

當有P的時候,分割槽產生問題,要麼選擇不服務(保持一致性),要麼忍受不一致,服務可用.
分割槽存在情況下,要麼選擇A,要麼選擇C