HackerTrans
トップ新着トレンドコメント過去質問紹介求人

oertl

no profile record

投稿

Techniques to beat Arrays.hashCode(byte[]) using Java's own means

dynatrace.com
13 ポイント·投稿者 oertl·昨年·0 コメント

ExaLogLog: Approximate distinct counting with 43% less space than HyperLogLog

arxiv.org
3 ポイント·投稿者 oertl·2 年前·1 コメント

コメント

oertl
·昨年·議論
[flagged]
oertl
·2 年前·議論
The algorithm is simple, which is why it is also suitable for textbooks. However, it is far from representing the state of the art. In case you are interested in the latest development, I have recently published a new distinct counting algorithm where the estimate does not depend on the processing order, which can be merged and requires only 3.5kB of memory to guarantee a standard error of 1.13% for counts up to exa-scale: https://arxiv.org/abs/2402.13726