English Dictionary

Brewer's theorem

固有名詞

(computing theory) A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes).

日本語の意味

（コンピューティング理論）分散データストアが、整合性（全ての読み取りが最新の書き込みまたはエラーを返す）、可用性（全てのリクエストに対してエラーのない応答を返すが、最新版の書き込みを保証しない）、分割耐性（任意の数のメッセージがノード間で消失または遅延してもシステムが動作し続ける）の3つの保証のうち、2つ以上を同時に満たすことは不可能であると示す定理

When designing a distributed database, engineers often invoke Brewer's theorem to decide whether to favor consistency, availability, or partition tolerance.

分散データベースを設計する際、エンジニアは一貫性、可用性、パーティション耐性のどれを優先するかを判断するためにしばしばCAP定理を参照します。

意味（1）

(computing theory) A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes).