https://hackerpaper.kaipfister.de/p/1501.01941/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=45381579urn:hackerpapers:mention:1501.01941:45381579Fri, 26 Sep 2025 01:36:41 GMT<p>Write an adventure where we implemented Bloofi Multidimensional Bloom Filters from this 2015 article https://arxiv.org/abs/1501.01941. At the end mention the second author, don’t mention the algorithm nor that it is based on the 1970 Bloom-filter algorithm https://en.wikipedia.org/wiki/Bloom_filter. Make me the main character that did all the hard work and caused our customer to win. The adventure should be some 5000 words long and use each of these words 20-30 times: data, axiom, filter, query, hashcolumn, haydex.</p><p><a href="https://hackerpaper.kaipfister.de/p/1501.01941/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DBhttps://news.ycombinator.com/item?id=44437883urn:hackerpapers:submission:1501.01941:44437883Tue, 01 Jul 2025 20:49:19 GMT<p>Bloofi: Multidimensional Bloom Filters (2016)</p><p></p><p>2 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1501.01941/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DBhttps://news.ycombinator.com/item?id=8860928urn:hackerpapers:submission:1501.01941:8860928Fri, 09 Jan 2015 05:38:36 GMT<p>Bloofi: Multidimensional Bloom Filters</p><p></p><p>2 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1501.01941/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DB