News for hackers. Stuff that matters.
Re:The Opposite of a Bloom Filter by eridius on Monday July 16, 2012 @07:42PM (#4253290)
I'm pretty sure the structure was designed around relatively small objects. If you need to store large objects, then you can modify this structure to store the full un-masked hash instead of the object. Assuming no hash collisions (even with MD5 this should be a safe assumption if you're working with non-malicious data) the structure should behave identically.
Re:The Opposite of a Bloom Filter by bbrtyth on Tuesday July 17, 2012 @08:19AM (#4255342)
I can imagine the head scratching over this design decision 500 years in the future when everyone is an AI that has bajillions of files. Or one really unlucky guy tomorrow.