<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Perfect Consistent Hashing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1503.04988/</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/1503.04988/feed.xml" rel="self" type="application/rss+xml" /><item><title>Perfect Consistent Hashing — mentioned by msackman</title><link>https://news.ycombinator.com/item?id=10788716</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.04988:10788716</guid><pubDate>Thu, 24 Dec 2015 16:53:04 GMT</pubDate><description>&lt;p&gt;I don&amp;#x27;t think that&amp;#x27;s the problem though. The problem that I&amp;#x27;m thinking of is that when a cluster grows in size, due to the use of consistent hashing, there&amp;#x27;ll be a set of objects that need to move between nodes. Calculating and achieving that movement is what concerns me. The exact properties are explained early on in http://arxiv.org/abs/1503.04988 I&amp;#x27;m not expecting to ever need to model a global property of &amp;quot;these are the set of nodes that are up and running&amp;quot;. I always worry about the effect of weird and wacky network issues on such systems.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.04988/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
