Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Re: Search an array ref of array refs

by bittondb (Novice)
on Nov 05, 2001 at 07:37 UTC ( #123265=note: print w/replies, xml ) Need Help??

in reply to Re: Search an array ref of array refs
in thread Search an array ref of array refs

Granted, the search is much more efficient in the DB, but I already have the whole table because I just used it to create a SELECT box on my web page. So the whole genesis behind this was to avoid another round trip to the DB, which IMHO, is more costly (but I could be wrong). :)
  • Comment on Re: Re: Search an array ref of array refs

Replies are listed 'Best First'.
Re:{3} Maintainability vs execution time? Was: Search an array ref of array refs
by jeroenes (Priest) on Nov 05, 2001 at 13:08 UTC
    What are you optimizing than? Execution speedup cq load time? Are you sure that it takes significantly more time to do an additional query to the server? I guess the connection is not closed between the statement. Maybe the DB is on the same box as the webserver.

    And even if it takes some additional timeframe (probably very small, test it!) for the query, is it worth the worse maintainability of perl code vs the SQL code?

    I generally would answer 'no', but your situation may be different. As ppl say: only optimize the code that needs optimization. Optimization leads to less quality code, so be sure you need it. Just consider what you are doing.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://123265]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2018-07-16 07:26 GMT
Find Nodes?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?

    Results (333 votes). Check out past polls.