in reply to Re^2: Fast algorithm for 2d array queries
in thread Fast algorithm for 2d array queries
"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?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^4: Fast algorithm for 2d array queries (Got OpenGL::Array)
by Anonymous Monk on Feb 07, 2014 at 12:13 UTC | |
by BrowserUk (Patriarch) on Feb 07, 2014 at 12:36 UTC | |
by Anonymous Monk on Feb 07, 2014 at 21:19 UTC | |
by BrowserUk (Patriarch) on Feb 07, 2014 at 22:27 UTC |