<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>An Efficient Read Dominant Data Replication Protocol under Serial Isolation using Quorum Consensus Approach · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1406.7423/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1406.7423/feed.xml" rel="self" type="application/rss+xml" /><item><title>An Efficient Read Dominant Data Replication Protocol under Serial Isolation using Quorum Consensus Approach — mentioned by hardwaresofton</title><link>https://news.ycombinator.com/item?id=18272617</link><guid isPermaLink="false">urn:hackerpapers:mention:1406.7423:18272617</guid><pubDate>Mon, 22 Oct 2018 06:36:13 GMT</pubDate><description>&lt;p&gt;Sorry, I think either my fundamental understanding is off or I wasn&amp;#x27;t clear enough in how I was imagining this happening... If you and a majority of nodes agree on a value like an CRDT OpSet (more simplistically, just agreeing on the state of the log), how does that not guarantee agreement and serializability? It is impossible from that point on to have a another majority of nodes have some other view of what happened. Consensus algorithms are One copy serializability is exactly what would be achieved by having a read and write quorum[0][1]. It intuitively makes sense to me (and maybe my…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1406.7423/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
