<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Algorithms on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/algorithms/</link>
    <description>Recent content in Algorithms on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 19 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/algorithms/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Self-Hosted Compressed Bitmap Indexes: Roaring Bitmap vs EWAH vs BitMagic vs bitset</title>
      <link>https://www.pistack.xyz/posts/2026-06-19-compressed-bitmap-indexes-roaring-ewah-bitmagic-bitset/</link>
      <pubDate>Fri, 19 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-19-compressed-bitmap-indexes-roaring-ewah-bitmagic-bitset/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Bitmap indexes are one of the oldest and most powerful indexing techniques in database systems — they encode set membership as bit strings where each bit position represents a row or document ID. When you need to compute fast intersections, unions, or differences of large datasets (AND, OR, NOT over millions of records), bitmaps are unmatched.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Self-Hosted Consistent Hashing: Jump Hash vs Ring Hash vs Rendezvous Hashing Libraries</title>
      <link>https://www.pistack.xyz/posts/2026-06-19-consistent-hashing-libraries-jump-hash-ring-hash-rendezvous/</link>
      <pubDate>Fri, 19 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-19-consistent-hashing-libraries-jump-hash-ring-hash-rendezvous/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;When building self-hosted distributed systems — from caching layers to load balancers to sharded databases — one fundamental problem keeps appearing: &lt;strong&gt;how do you distribute data or requests across a changing set of servers without reshuffling everything?&lt;/strong&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>Self-Hosted Probabilistic Data Structures: Bloom Filters vs Cuckoo Filters vs HyperLogLog vs Count-Min Sketch</title>
      <link>https://www.pistack.xyz/posts/2026-06-19-probabilistic-data-structures-bloom-cuckoo-hyperloglog-countmin/</link>
      <pubDate>Fri, 19 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-19-probabilistic-data-structures-bloom-cuckoo-hyperloglog-countmin/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;When building self-hosted monitoring systems, analytics pipelines, or distributed databases, you frequently need to answer questions like &amp;ldquo;have I seen this user before?&amp;rdquo;, &amp;ldquo;how many unique visitors today?&amp;rdquo;, or &amp;ldquo;what are the top 100 most frequent items?&amp;rdquo; — but at massive scale where exact answers are too expensive.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
