BoomFilters

Languages and libraries

probabilistic data structures library

SHOW HN2015

70points
13comments
#393of 2,565 in 2015
Top 16%of 2015 by points

How HN took it

QuietFewer than 5 comments about the project

0 positive, 1 neutral or asking, 0 mixed, 1 critical, out of 2 comments about the project.

Docs: 0 for, 1 against

The thread, comment by comment

Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.

positive neutral or mixed critical about another commenter or something else the maker

What HN said

What people liked

  • Tyler's blog has good solid content for concurrency enthusiasts

    From 1 comment
    • You should checkout Tyler's blog. Good solid content for the concurrency geeks.
      eternalban on HN

Objections

  • InverseBloomFilter claim of no false positives is disputed as impossible in constant space

    From 3 comments
    • // The InverseBloomFilter may report a false negative but can never report a false positive. This is actually not true and not possible. There is a good explanation here:…
      hurin on HN
    • That InverseBloomFilter sounds like an LRU cache of hashes. A true inverse bloom filter can be proven to be impossible, sadly.
      wcdolphin on HN
    • Then it doesn't do it in constant space. Constant space is the property that makes it not a true inverse bloom filter, and instead is just a cache with an interesting hashed…
      zeeboo on HN
  • Naming is misleading; the InverseBloomFilter is really a cache

    From 3 comments
    • // The InverseBloomFilter may report a false negative but can never report a false positive. This is actually not true and not possible. There is a good explanation here:…
      hurin on HN
    • Well, I'm looking at the code and it looks like it doesn't report false positives. I understand that you expect it to hash the content down and store only the hash, but it…
      frankmcsherry on HN
    • That InverseBloomFilter sounds like an LRU cache of hashes. A true inverse bloom filter can be proven to be impossible, sadly.
      wcdolphin on HN
  • README uses Boom and Bloom inconsistently

    From 1 comment
    • Why does the readme use Boom and Bloom interchangeably? Is it just a typo that for some reason is randomly scattered throughout the document (and in the repo name itself)? Or is…
      natch on HN

Questions

  • Why the README uses both Boom and Bloom interchangeably

    From 2 comments
    • Why does the readme use Boom and Bloom interchangeably? Is it just a typo that for some reason is randomly scattered throughout the document (and in the repo name itself)? Or is…
      natch on HN
    • Looks consistently used to me. The project is a collection of stream-optimized bloom filters and the project or its filters, as a whole, are referred to as "Boom Filters" in…
      lstamour on HN

Alternatives named

  • Classic Bloom filters

    From 1 comment
    • Looks consistently used to me. The project is a collection of stream-optimized bloom filters and the project or its filters, as a whole, are referred to as "Boom Filters" in…
      lstamour on HN
  • Cuckoo hashing

    From 1 comment
    • I guess it's storing the pointer to the data? That sounds pretty bad. At any-rate it's one of two things, either you store the whole item or you store a hash. If you're storing…
      hurin on HN

Category, keywords, summaries and labels on this page were made by AI (Thread Reader v2) and not checked by hand. Each point links to the comments it came from.

Add a badge to your READMEShown on HackerShow
[![Shown on HackerShow](https://hackershow.org/badge.svg)](https://hackershow.org/show/9360255)