<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:hatena="http://www.hatena.ne.jp/info/xmlns#"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
>

<channel rdf:about="https://b.hatena.ne.jp/entry/s/calabro.io/ohbf">
<title>&#x306F;&#x3066;&#x306A;&#x30D6;&#x30C3;&#x30AF;&#x30DE;&#x30FC;&#x30AF; - One Hash Bloom Filters - Jim Calabro</title>
<link>https://b.hatena.ne.jp/entry/s/calabro.io/ohbf</link>
<description>Note: as always, all my public writing is written by hand by me. Overview A bloom filter is a probabilistic data structure that allows you to quickly and cheaply answer the question &#x22;is key X in th...</description>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="https://b.hatena.ne.jp/tengo1985/20261020#bookmark-4794675585067378466" />
  <rdf:li rdf:resource="https://b.hatena.ne.jp/toshikish/20261020#bookmark-4794675585067378466" />
  <rdf:li rdf:resource="https://b.hatena.ne.jp/en-en-ra/20261020#bookmark-4794675585067378466" />
  <rdf:li rdf:resource="https://b.hatena.ne.jp/teppey/20261020#bookmark-4794675585067378466" />
  <rdf:li rdf:resource="https://b.hatena.ne.jp/yowa/20261020#bookmark-4794675585067378466" />
  <rdf:li rdf:resource="https://b.hatena.ne.jp/xef/20261020#bookmark-4794680619844038530" />
 </rdf:Seq>
</items>
</channel>
<item rdf:about="https://b.hatena.ne.jp/tengo1985/20261020#bookmark-4794675585067378466">
<title>tengo1985</title>
<link>https://b.hatena.ne.jp/tengo1985/20261020#bookmark-4794675585067378466</link>
<description></description>
<dc:date>2026-10-20T03:32:41Z</dc:date>
</item>
<item rdf:about="https://b.hatena.ne.jp/toshikish/20261020#bookmark-4794675585067378466">
<title>toshikish</title>
<link>https://b.hatena.ne.jp/toshikish/20261020#bookmark-4794675585067378466</link>
<description></description>
<dc:date>2026-10-20T03:11:05Z</dc:date>
</item>
<item rdf:about="https://b.hatena.ne.jp/en-en-ra/20261020#bookmark-4794675585067378466">
<title>en-en-ra</title>
<link>https://b.hatena.ne.jp/en-en-ra/20261020#bookmark-4794675585067378466</link>
<description></description>
<dc:date>2026-10-20T02:47:30Z</dc:date>
<dc:subject>&#x3042;&#x3068;&#x3067;&#x8AAD;&#x3080;</dc:subject>
<taxo:topics>
  <rdf:Bag>
    <rdf:li resource="https://b.hatena.ne.jp/q/%E3%81%82%E3%81%A8%E3%81%A7%E8%AA%AD%E3%82%80" />
  </rdf:Bag>
</taxo:topics>
</item>
<item rdf:about="https://b.hatena.ne.jp/teppey/20261020#bookmark-4794675585067378466">
<title>teppey</title>
<link>https://b.hatena.ne.jp/teppey/20261020#bookmark-4794675585067378466</link>
<description></description>
<dc:date>2026-10-20T02:35:52Z</dc:date>
</item>
<item rdf:about="https://b.hatena.ne.jp/yowa/20261020#bookmark-4794675585067378466">
<title>yowa</title>
<link>https://b.hatena.ne.jp/yowa/20261020#bookmark-4794675585067378466</link>
<description></description>
<dc:date>2026-10-20T02:31:46Z</dc:date>
</item>
<item rdf:about="https://b.hatena.ne.jp/xef/20261020#bookmark-4794680619844038530">
<title>xef</title>
<link>https://b.hatena.ne.jp/xef/20261020#bookmark-4794680619844038530</link>
<description></description>
<dc:date>2026-10-20T01:40:06Z</dc:date>
<dc:subject>Algorithm</dc:subject>
<taxo:topics>
  <rdf:Bag>
    <rdf:li resource="https://b.hatena.ne.jp/q/Algorithm" />
  </rdf:Bag>
</taxo:topics>
</item>
</rdf:RDF>