<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:media="http://search.yahoo.com/mrss/"><channel><title>Algorithms on Shaowen Chen's Website</title><link>https://www.chenshaowen.com/en/tags/algorithms/</link><description>Recent content in Algorithms on Shaowen Chen's Website</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>&amp;copy;2016 - {year}, All Rights Reserved.</copyright><lastBuildDate>Tue, 01 Dec 2020 00:00:00 +0000</lastBuildDate><sy:updatePeriod>weekly</sy:updatePeriod><atom:link href="https://www.chenshaowen.com/en/tags/algorithms/atom.xml" rel="self" type="application/rss+xml"/><item><title>A Practical Algorithm: Bloom Filter</title><link>https://www.chenshaowen.com/en/blog/practical-algorithm-of-bloom-filter.html</link><pubDate>Tue, 01 Dec 2020 00:00:00 +0000</pubDate><atom:modified>Tue, 01 Dec 2020 00:00:00 +0000</atom:modified><guid>https://www.chenshaowen.com/en/blog/practical-algorithm-of-bloom-filter.html</guid><description>1. What Is Bloom Filter A Bloom Filter is a data structure proposed by Bloom in 1970.
It maps elements (x, y, z) through a series of functions into a binary vector (a 0101 sequence), and is used to quickly determine whether an element w is in a set. As shown below (from Wikipedia):</description><dc:creator>微信公众号</dc:creator><category>Algorithms</category><category>R&amp;D</category><category>Go</category><category>Optimization</category><category>Bloom Filter</category></item></channel></rss>