Revision as of 13:52, 18 December 2020 edit Murtaza.aliakbar (talk \| contribs) Extended confirmed users 5,543 edits m →Min/max sketches: authorlink ← Previous edit		Revision as of 22:03, 6 July 2021 edit undo Frap (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 35,598 edits m →Solving the weighted count-distinct problem: unlink double reference Next edit →
Line 66: .<ref>{{cite journal \| last1=Cohen \|author1-link=Edith Cohen\| first1=Reuven \| last2 = Katzir \| first2 = Liran \| last3=Yehezkel \| first3=Aviv \| year=2014\| title=A Unified Scheme for Generalizing Cardinality Estimators to Sum Aggregation \| journal=Information Processing Letters\|doi=10.1016/j.ipl.2014.10.009 \| volume=115 \|issue=2\| pages=336–342}}</ref> For example, the weighted estimator proposed by Cohen et al.<ref name=edithCohen /> can be obtained when the continuous max sketches estimator is extended to solve the weighted problem. In particular, the [[HyperLogLog]] algorithm <ref name=hyperloglog /> can be extended to solve the weighted problem. The extended [[HyperLogLog]] algorithm offers the best performance, in terms of statistical accuracy and memory usage, among all the other known algorithms for the weighted problem. ==See also==

Count-distinct problem: Difference between revisions