Global Information Lookup Global Information

PACELC theorem information


The tradeoff between availability, consistency and latency, as described by the PACELC theorem.

In database theory, the PACELC theorem is an extension to the CAP theorem. It states that in case of network partitioning (P) in a distributed computer system, one has to choose between availability (A) and consistency (C) (as per the CAP theorem), but else (E), even when the system is running normally in the absence of partitions, one has to choose between latency (L) and loss of consistency (C).

and 4 Related for: PACELC theorem information

Request time (Page generated in 0.765 seconds.)

PACELC theorem

Last Update:

In database theory, the PACELC theorem is an extension to the CAP theorem. It states that in case of network partitioning (P) in a distributed computer...

Word Count : 983

CAP theorem

Last Update:

result restricted this lower bound to non-commuting operations. The PACELC theorem, introduced in 2010, builds on CAP by stating that even in the absence...

Word Count : 868

Daniel Abadi

Last Update:

Abadi was the first to describe the PACELC theorem in a 2010 blog post. PACELC, a response to the CAP theorem, was proved formally in 2018 in a SIGACT...

Word Count : 583

Fallacies of distributed computing

Last Update:

... The party you are communicating with is trustworthy." CAP theorem PACELC theorem Distributed computing Fine vs coarse grained SOA Wilson, Gareth...

Word Count : 530
PDF Search Engine © AllGlobal.net