"Or how many lookups you need to do? " about 15000000 per hour.
That's 4000 per second or 1 every 1/4 of a millisecond.
In that time you want to intersect 500 to 1000 (from 3,000) sets of 50,000 integers and extract the single most populous integer across them all.
Do you have a 3000 machine cluster available to throw at this problem?
In reply to Re^3: Fast algorithm for 2d array queries (Got a cluster?)
by BrowserUk
in thread Fast algorithm for 2d array queries
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |