Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search — mentioned by thomasahle

Wed, 10 Jun 2020 13:28:47 GMT

I love this quote from a follow up paper: > Interestingly, hash algorithms with collision probabilities equal to JP have already been unintentionally presented before JP was actually discovered and thoroughly analyzed in [8]. In [7] a data structure called HistoSketch was proposed to calculate signatures for JN ... after some simplifications and thanks to a nonequivalent transformation that eliminated the scale dependence, the final HistoSketch algorithm had a collision probability equal to JP instead of the originally desired JN. It's none the less a very interesting measure. Thanks for…

Paper and discussion history. A mention is not an endorsement.

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search · HackerPapers discussions

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search — mentioned by thomasahle