<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Data Structures - Category - Arkadiusz Plich - tech blog</title>
        <link>http://plich.me/categories/data-structures/</link>
        <description>Data Structures - Category - Arkadiusz Plich - tech blog</description>
        <generator>Hugo -- gohugo.io</generator><language>en-us</language><managingEditor>Arkadiusz@Plich.me (Arkadiusz Plich)</managingEditor>
            <webMaster>Arkadiusz@Plich.me (Arkadiusz Plich)</webMaster><lastBuildDate>Sat, 20 Jul 2024 20:00:00 &#43;0200</lastBuildDate><atom:link href="http://plich.me/categories/data-structures/" rel="self" type="application/rss+xml" /><item>
    <title>Bloom filter</title>
    <link>http://plich.me/posts/10/bloom_filter/</link>
    <pubDate>Sat, 20 Jul 2024 20:00:00 &#43;0200</pubDate><author>
        <name>Arkadiusz Plich</name>
    </author><guid>http://plich.me/posts/10/bloom_filter/</guid>
    <description><![CDATA[<p>Have you ever wondered how it happens that when you try to register on a very popular portal, entering a made-up username, you get a response in a split second that this username is already taken and you should try another one?
I&rsquo;ll be honest, I didn&rsquo;t either, but coincidentally, while reading Data Intensive Applications by Martin Kleppmann, I probably learned this secret. It is the Bloom filter. Or maybe not. Actually, I don’t know if there are companies using Bloom filter to verify usernames of their users, but I think this example is easy to understand, so I will stick with it).</p>]]></description>
</item></channel>
</rss>
