Last Updated：2025/12/05
(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).
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Brewer's theorem
Edit Histories（0）
Source Word
Brewer's theorem
Proper noun
(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).
Japanese Meaning
（コンピューティング理論）分散データストアが、整合性（全ての読み取りが最新の書き込みまたはエラーを返す）、可用性（全てのリクエストに対してエラーのない応答を返すが、最新版の書き込みを保証しない）、分割耐性（任意の数のメッセージがノード間で消失または遅延してもシステムが動作し続ける）の3つの保証のうち、2つ以上を同時に満たすことは不可能であると示す定理
Sense（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).
