Skip to content

Comment on Damn Cool Algorithms: Cardinality Estimationparent

Comments

That's not what I said. Generating a predictable distribution by hashing is old hat.

What's awesome is you can then make inferences about the original data from those hashes -- something that good hash functions are supposed to be resistant to, in isolation.

It works here because we only care whether two bits of data are equal -- and a hash function had better preserve that relationship!

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.