Re:How we store 400M phone numbers with fast lookup
by bpicolo on Sunday July 19, 2015 @06:37PM
(#9913121)
I mean, a bloom filter isn't super difficult, but it's also probabilistic instead of deterministic.
[ Parent
| on HN ]
Re:How we store 400M phone numbers with fast lookup
by fleitz on Sunday July 19, 2015 @06:57PM
(#9913186)
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...