按年被提到
20172018 · 2 次2026
系统、数据库与网络›数据库与向量检索·arXiv:1702.01284 · cs.DS

New cardinality estimation algorithms for HyperLogLog sketches

Otmar Ertl · 2017
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2017-06-26 · 最近 2018-11-14
2不同的人
3活跃月份
3讨论串
24被引(OpenAlex)
arXiv 摘要(候选层不写导读)

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 presented that eliminates the bias for small and large cardinalities. Based on the maximum likelihood principle a second unbiased method is derived together with a robust and efficient numerical algorithm to calculate the estimate. The maximum likelihood approach can also be applied to more than a single HyperLogLog sketch. In particular, it is shown that it gives more precise cardinality estimates for union, intersection, or relative complements of two sets that are both represented by HyperLogLog sketches compared to the conventional technique using the inclusion-exclusion principle. All the new methods are demonstrated and verified by extensive simulations.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论jbapple · 2017-06

“How does the Xiao et al. paper (which introduces TailCut, "Better with Fewer Bits: Improving the Performance of Cardinality Estimation of Large Data Streams", <http://cse.seu.edu.cn/PersonalPage/csqjxiao/csqjxiao_files/papers/INFOCOM17.pdf>) compare with Ertl's "New cardinality estimation algorithms for HyperLogLog sketches", <https://arxiv.org/abs/1702.…”

Show HN: An improved version of HyperLogLog原评论 ↗
评论stochastic_monk · 2018-01

“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 operations for genome comparisons. The great thing about these operations is that the cost of operations scales with the size of the sketch, not the size of the dataset being sketched.…”

Show HN: HyperLogLog intersections原评论 ↗
评论stochastic_monk · 2018-11

“In my benchmarks, HyperLogLogs unilaterally outperform MinHash* by a constant factor, while Bloom Filters of the same size become more accurate than hyperloglogs in the 100-500kB range (though this number increases with the cardinalities of sets being compared). The biggest advantage a HyperLogLog has over MinHash and bloom filters is that it works well r…”

HyperMinHash: Bringing intersections to HyperLogLog原评论 ↗