HN Explorer

oertl

↗ HN profile [ 47.9 ms ] full profile
Karma
0
Created
()
Submissions
0
  1. Techniques to beat Arrays.hashCode(byte[]) using Java's own means (dynatrace.com)
    13 points 0
  2. ExaLogLog: Approximate distinct counting with 43% less space than HyperLogLog (arxiv.org)
    3 points 1
  3. UltraLogLog: A more space-efficient alternative to HyperLogLog

    The newest version of the hash4j Java library (https://github.com/dynatrace-oss/hash4j) introduces UltraLogLog, a new data sketch for approximate distinct counting that uses 22% less space than HyperLogLog using 6-bit…

    1 points 0
  4. Dynatrace Hash Library for Java (github.com)
    2 points 0
  5. SetSketch: Filling the Gap Between MinHash and HyperLogLog (arxiv.org)
    2 points 0
  6. DynaHist: A Dynamic Histogram Library for Java (github.com)
    1 points 0
  7. Fast Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity (arxiv.org)
    2 points 0