Comments on: Time based bloom filters http://blog.apokalyptik.com/2010/01/06/time-based-bloom-filters/ The random things that spew forth from my brain... Mon, 16 Jan 2012 18:43:29 +0000 hourly 1 http://wordpress.org/?v=3.4-alpha-19620 By: apokalyptik http://blog.apokalyptik.com/2010/01/06/time-based-bloom-filters/comment-page-1/#comment-8750 apokalyptik Thu, 07 Jan 2010 09:58:32 +0000 http://blog.apokalyptik.com/?p=498#comment-8750 Interesting. It could be said that the entire vector, assuming a hit, could be no newer than the oldest of its points. Also if you used some sort of decaying model you could make a guess at how false a positive might be based on a sort of communal agreement -- how many share the same age Interesting. It could be said that the entire vector, assuming a hit, could be no newer than the oldest of its points. Also if you used some sort of decaying model you could make a guess at how false a positive might be based on a sort of communal agreement — how many share the same age

]]> By: Andy http://blog.apokalyptik.com/2010/01/06/time-based-bloom-filters/comment-page-1/#comment-8749 Andy Thu, 07 Jan 2010 09:06:54 +0000 http://blog.apokalyptik.com/?p=498#comment-8749 Each counting "bit" gets a TTL. Curious. I'd think decay would be more appropriate---closer to a model of perceptual impact---than complete expiration. How would we do that? Each bit a process. You know where this is going... :-) Each counting "bit" gets a TTL. Curious. I'd think decay would be more appropriate—closer to a model of perceptual impact—than complete expiration. How would we do that? Each bit a process. You know where this is going… :-)

]]>