Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on How we store 400M phone numbers with fast lookup. Parent comment
Also, typically bloom filters don't come out of the box with the language you're using, so it's just more potential for bugs.
A lookup on a sorted array should take 8.6 comparisons anyway, I bet the hashing takes longer...
There are no comments on this comment yet.
Also, typically bloom filters don't come out of the box with the language you're using, so it's just more potential for bugs.
A lookup on a sorted array should take 8.6 comparisons anyway, I bet the hashing takes longer...