42 citations · 194 across the 18 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017★ 7 cited
New Cardinality Estimation Methods for HyperLogLog Sketches
Otmar Ertl
This work presents new cardinality estimation methods for data sets recorded by HyperLogLog sketches. A simple derivation of the original estimator was found, that also gives insig…
cs.DS2017★ 12 cited
SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation
Otmar Ertl
This paper presents a new algorithm for calculating hash signatures of sets which can be directly used for Jaccard similarity estimation. The new approach is an improvement over th…
cs.DS2017★ 17 cited
New cardinality estimation algorithms for HyperLogLog sketches
Otmar Ertl
This paper presents new methods to estimate the cardinalities of data sets recorded by HyperLogLog sketches. A theoretically motivated extension to the original estimator is presen…