@avibryant take a look at this: https://github.com/twitter/algebird/pull/327 … — an obvious attempt at HLL intersections (which worked more or less in the REPL).
@posco in general this feels like a drastic overestimate. You're really dealing with min(|A|,|B|), which can be >> |A ^ B|.
-
-
@avibryant you aren't dealing with min(|A|, |B|). Byte wise min will be smaller than that. Try it with some small sets. -
@posco no, I understand that. Just saying that on a byte by byte level, that's what you're starting with. -
@posco obviously you get lots of info from the sparsity of the vectors, but they don't stay sparse forever. -
@avibryant I'll do some analysis tomorrow. Do some numerical tests.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.