<?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 Ethan-ZYF</title><link>https://ethanzyf.com/tags/hashing/</link><description>Recent content in Hashing on Ethan-ZYF</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 31 May 2026 01:10:00 -0700</lastBuildDate><atom:link href="https://ethanzyf.com/tags/hashing/index.xml" rel="self" type="application/rss+xml"/><item><title>HyperLogLog: Counting Billions of Distinct Items in Kilobytes</title><link>https://ethanzyf.com/blog/hyperloglog/</link><pubDate>Sun, 31 May 2026 01:10:00 -0700</pubDate><guid>https://ethanzyf.com/blog/hyperloglog/</guid><description>&lt;p&gt;HyperLogLog (HLL) is a probabilistic &lt;strong&gt;cardinality estimation&lt;/strong&gt; algorithm: using a tiny, fixed amount of memory (typically ~12 KB), it estimates the number of &lt;em&gt;distinct&lt;/em&gt; elements in a huge set, with a standard error of about 0.81%.&lt;/p&gt;</description></item><item><title>Cuckoo Filter: Approximate Membership That Supports Deletion</title><link>https://ethanzyf.com/blog/cuckoo-filter/</link><pubDate>Sun, 31 May 2026 00:45:00 -0700</pubDate><guid>https://ethanzyf.com/blog/cuckoo-filter/</guid><description>&lt;p&gt;A Cuckoo Filter is a probabilistic data structure for approximate set membership. Like a Bloom filter it answers &amp;ldquo;is this element &lt;em&gt;possibly&lt;/em&gt; in the set?&amp;rdquo; with a tunable false-positive rate and zero false negatives — but unlike a standard Bloom filter it also supports &lt;strong&gt;deleting&lt;/strong&gt; elements, is more space-efficient at low false-positive rates, and is more cache-friendly on lookups.&lt;/p&gt;</description></item></channel></rss>