<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quorums on Distributed Data Insights</title><link>http://ddinsights.net/tags/quorums/</link><description>Recent content in Quorums on Distributed Data Insights</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 05 Jun 2026 09:00:00 -0700</lastBuildDate><atom:link href="http://ddinsights.net/tags/quorums/index.xml" rel="self" type="application/rss+xml"/><item><title>Quorums and Tunable Consistency</title><link>http://ddinsights.net/posts/quorums-and-tunable-consistency/</link><pubDate>Fri, 05 Jun 2026 09:00:00 -0700</pubDate><guid>http://ddinsights.net/posts/quorums-and-tunable-consistency/</guid><description>&lt;p>Many distributed databases — Dynamo-style stores like Cassandra and Riak — don&amp;rsquo;t
make you choose consistency once and for all. They let you tune it &lt;strong>per request&lt;/strong>
using quorums. The mechanism is simple arithmetic with surprisingly deep
consequences.&lt;/p>
&lt;h2 id="the-setup">The setup&lt;/h2>
&lt;p>Each piece of data is replicated to &lt;strong>N&lt;/strong> nodes. For every operation you pick:&lt;/p>
&lt;ul>
&lt;li>&lt;strong>W&lt;/strong> — how many replicas must acknowledge a &lt;em>write&lt;/em> before it&amp;rsquo;s considered done.&lt;/li>
&lt;li>&lt;strong>R&lt;/strong> — how many replicas you read from and compare before returning.&lt;/li>
&lt;/ul>
&lt;p>The headline rule:&lt;/p></description></item></channel></rss>