Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Basic Perl array intersection faster than mysql query join.

by SpanishInquisition (Pilgrim)
on Oct 12, 2004 at 20:37 UTC ( [id://398682]=note: print w/replies, xml ) Need Help??


in reply to Basic Perl array intersection faster than mysql query join.

SQL has overhead to prepare queries -- stored procedures will probably be faster. But *more importantly* SQL has an overhead to establish a connection. When your data scales to 9 million rows, I seriously doubt Perl will be faster. Of course, in that case, you need to invest in something a little more robust than MySQL... (or at least move to postgres).

Do not confuse your test environment with your production environment when running benchmarks. Make sure both are equally complex and large. Also consider the network overhead, what kind of server you have running the DB, what kind of disks it has, etc. As your problem scales in complexity and data size, things can/will change.

My point of reference is batch operations for AT&T databases ... for a simple run-on-my-linux-box-for-purpose-X application, yeah, that may be a moot point.

  • Comment on Re: Basic Perl array intersection faster than mysql query join.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://398682]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (6)
As of 2024-04-25 08:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found