hyperminhash
Languages and libraries
probabilistic data structure library
SHOW HN2018
How HN took it
3 positive, 4 neutral or asking, 1 mixed, 1 critical, out of 9 comments about the project. Thread score +0.22.
Idea: 1 for, 1 againstExecution: 1 for, 0 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
Useful library for approximate set operations
From 2 comments
Useful library. I hope someone out there is writing one for Java as well.
kgdinesh on HNThis is great! Probabilistic datastructures are amazing. I did straight up HLL++ a while ago but had to do intersection with the inclusion–exclusion principle. It would be cool…
mynameisfiber on HN
Implementation is more efficient than the prototype Python version
From 1 comment
Thanks so much for producing a Golang implementation of our HyperMinHash paper (I'm the first author) [0] and pointing me to your Hackernews post! As an aside, we also have a…
yunwilliamyu on HN
Objections
Naive HLL intersection via min of counts is inaccurate for cardinality estimation
From 1 comment
Great work! I haven't messed around with the count-min augmentation for HLLs, but I've had a lot of success in practice. I've experimented with using HLL sketches for set…
stochastic_monk on HN
Requests
Java implementation
From 1 comment
Useful library. I hope someone out there is writing one for Java as well.
kgdinesh on HN
Questions
What is the code at hyperminhash.go line 102 meant to do
From 1 comment
What is this[1] supposed to do? [1]: https://github.com/axiomhq/hyperminhash/blob/master/hyperminhash.go#L102
geocar on HN
How well does merging many HyperLogLogs keep cardinality accuracy
From 1 comment
Forgive me if this is a dumb question, but is this library a way of merging multiple HyperLogLogs together and still have a reasonable cardinality estimate? What sort of loss do…
djhworld on HN
Recommended resources for learning probabilistic data structures
From 1 comment
I recently discovered probabilistic data structure and find it very interesting, bloom filter and hyperloglog is super cool, I am interested in learning more, is there recommend…
bulldoa on HN
Alternatives named
HLL-MinHash via AdRoll cantor library
From 2 comments
HLL intersections using MinSketch has been around for a while now, I remember writing a Go implementation a couple years back based on a AdRoll blog post…
nemothekid on HNHi there! I'm the author of the paper the OP implemented, so I thought I'd give a bit more context. In practice, combining together HLL and MinHash as they do for AdRoll gives…
yunwilliamyu on HN
Inclusion-exclusion with gohll
From 1 comment
This is great! Probabilistic datastructures are amazing. I did straight up HLL++ a while ago but had to do intersection with the inclusion–exclusion principle. It would be cool…
mynameisfiber on HN
Ertl's improved HLL estimation with dnbaker/hll
From 1 comment
Great work! I haven't messed around with the count-min augmentation for HLLs, but I've had a lot of success in practice. I've experimented with using HLL sketches for set…
stochastic_monk on HN