News for hackers. Stuff that matters.

A comment on Computer Scientists Invent an Efficient New Way to Count.

Re:Computer Scientists Invent an Efficient New Way to Count by fnord77 on Friday May 17, 2024 @02:01PM (#40392566)
With other count-distinct algorithms, you can do unions and intersections on the "sets". (theta sketches, even bloom filiters)

Can you do this with CVM?

[ Parent | on HN ]
Re:Computer Scientists Invent an Efficient New Way to Count by kuldeepmeel on Sunday May 19, 2024 @06:36PM (#40410268)
Unfortunately, not, and that's an interesting open problem as other count-distinct algorithms don't work for "structured sets", while this one does.

https://dl.acm.org/doi/10.1145/3452021.3458333

[ Parent | on HN ]