Hi thundergnat,
Right, but I am looking for pairs from the 70k array, so that leaves me 70k x 70k / 2 = 2.4 billion pairs, of which I probably only need about 100 million (about 4%) so I really do need to get them randomly.
But you're definitely right that holding the property-lists in memory is the obvious place to start tuning. Just wanted to figure out first if that's truly where the script is spending all its time!
In reply to Re^2: Benchmarking A DB-Intensive Script
by bernanke01
in thread Benchmarking A DB-Intensive Script
by bernanke01
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |