The subtlety of that troll takes a little while to sink in.
-
-
Replying to @burkelibbey
@burkelibbey are you calling the opposite bloom filter a troll?1 reply 0 retweets 0 likes -
Replying to @avibryant
@avibryant I can't tell. Conceptually it's identical to a random-expiry cache.1 reply 0 retweets 0 likes -
Replying to @burkelibbey
.
@burkelibbey use case: you need to perform an expensive but idempotent operation (eg write to disk) for each item in a stream with dupes.2 replies 1 retweet 0 likes -
Replying to @avibryant
@avibryant I totally get that it has real use cases. I was just thrown by my sudden realization that it's entirely not-novel.1 reply 0 retweets 0 likes
Replying to @burkelibbey
@burkelibbey gotcha. A lot of useful probabilistic data structures look like "hash tables with no conflict handling" if you squint...
9:26 PM - 25 Jan 2013
from Capital, British Columbia
0 replies
0 retweets
0 likes
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.