<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hashing on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/hashing/</link><description>Recent content in Hashing on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 19 Mar 2019 09:00:00 -0800</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/hashing/feed.xml" rel="self" type="application/rss+xml"/><item><title>Consistent Hashing</title><link>https://www.rik-kisnah.ai/teach/systems/consistent-hashing/</link><pubDate>Tue, 19 Mar 2019 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/systems/consistent-hashing/</guid><description>Put the servers on a clock face. Put each key on the clock face too. Walk clockwise to find its server. Add a server and only the keys just behind it move. This is how caches, key-value stores and load balancers all share work without a reshuffle.</description></item><item><title>Design a URL Shortener</title><link>https://www.rik-kisnah.ai/teach/systems/design-a-url-shortener/</link><pubDate>Tue, 17 May 2016 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/systems/design-a-url-shortener/</guid><description>Turn a long web address into a short one and back again. One table, one counter, one cache, one redirect. The whole design is deciding how to make the short code so two people never get the same one, then making the read path fast because reads outnumber writes a thousand to one.</description></item></channel></rss>