Comment on How we store 400M phone numbers with fast lookupparentComments−bpicolo11yI mean, a bloom filter isn't super difficult, but it's also probabilistic instead of deterministic.−fleitz11yExactly, so you'd need the array anyway...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...
Comments
I mean, a bloom filter isn't super difficult, but it's also probabilistic instead of deterministic.
Exactly, so you'd need the array anyway...
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...