Comment on How we store 400M phone numbers with fast lookupparentComments−vidarh11yNow do fast lookups. It needs an index, which is what their post is about.−fleitz11yIt doesn't need an index, it just needs to be sorted...Then you can do fast lookups...−vidarh11yYou still won't get fast lookups without an index.And if you've first sorted it, you can save space with an index in the form of a trie or limited skip list by eliminating common prefixes.−latch11ynot to mention that it's so little memory that you can treat the live version as read-only and swap in new versions.
Comments
Now do fast lookups. It needs an index, which is what their post is about.
It doesn't need an index, it just needs to be sorted...
Then you can do fast lookups...
You still won't get fast lookups without an index.
And if you've first sorted it, you can save space with an index in the form of a trie or limited skip list by eliminating common prefixes.
not to mention that it's so little memory that you can treat the live version as read-only and swap in new versions.