in reply to Basic Perl array intersection faster than mysql query join.
The most obvious thing though is that in order to do this in Perl you have to retrieve all of the records that you might possibly be interested in so that you can examine them. In any database of non-trivial size, that would be a very slow operation. In short, your in-memory approach will lose to the database as soon as the amount of data to be examined reaches a point where fetching it all from the database is too slow.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Basic Perl array intersection faster than mysql query join.
by zakzebrowski (Curate) on Oct 18, 2004 at 13:56 UTC |