[MINI] The CAP Theorem episode artwork

EPISODE · Jun 17, 2016 · 10 MIN

[MINI] The CAP Theorem

from Data Skeptic

Distributed computing cannot guarantee consistency, accuracy, and partition tolerance. Most system architects need to think carefully about how they should appropriately balance the needs of their application across these competing objectives. Linh Da and Kyle discuss the CAP Theorem using the analogy of a phone tree for alerting people about a school snow day.

Episode metadata supplied by the publisher feed · Published Jun 17, 2016

Embed this episode

Ready to play

[MINI] The CAP Theorem

0:00 10:32

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 10 minutes long.

When was this Data Skeptic episode published?

This episode was published on June 17, 2016.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!