3 ms·
Except, 1 billion isn't typically considered _big_ to even perform full scan searches. It's only big if it's expensive to search all of them, and that problem
by jpollock 5y ago
Except, 1 billion isn't typically considered _big_ to even perform full scan searches.
It's only big if it's expensive to search all of them, and that problem is very easily parallelizable.
Which makes it a $$->time equation? If it costs 1s for 1 machine to check an item, you will need 32 machines to check a billion in a year, or 12000 to search in a day.
So, it's the is_match operator that's expensive, rather than data storage? Is the match check minutes long or needing human oversight?
- whatshisface 5y agoChecking a molecule can take years of computer time on a supercomputer, depending on what you are checking for. There is no upper bound to the difficulty of checking because you can always ask for a more complex situation, and you are usually asking for those situations because the simple things are usually already discovered.