Timeline for Is it possible to efficiently store all possible phone numbers in memory?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 16, 2012 at 14:35 | vote | accept | Spencer Kormos | ||
| Apr 16, 2012 at 14:35 | comment | added | Spencer Kormos | Right. After rereading, that makes sense (fuzzy morning brain). Thanks. | |
| Apr 16, 2012 at 14:32 | comment | added | Izkata | @SpencerK The idea is that the search/lookup knows about the invalid patterns as well, so that numbers that match it don't need to be stored at all. If the 8 billion can be dropped to ~6 billion by the same reason, then you only have to store, what, less than 1 billion for the unused valid numbers? | |
| Apr 16, 2012 at 13:53 | comment | added | Spencer Kormos | The reason I said 6 billion is that for the same reason that you reduce the "permutable" set from 10 down to 8 billion based on illegal area codes, you would do the same exact thing for exchanges, thus dropping it down another 2 billion (roughly). This then makes storing unused numbers almost as bad as used numbers. I do like the idea though. | |
| Apr 15, 2012 at 3:42 | history | answered | Izkata | CC BY-SA 3.0 |