Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^2: A profiling surprise ...

by chexmix (Hermit)
on May 23, 2008 at 20:54 UTC ( #688221=note: print w/replies, xml ) Need Help??

in reply to Re: A profiling surprise ...
in thread A profiling surprise ...

Hmm ... walking to and from the barbershop about an hour ago, I was indeed thinking that "perhaps something could be done data-wise to minimize the number of database calls."

I'll take a look at that MySQL feature ... am stuck with Sybase here, I'm afraid.

At least I got a haircut. :D

Replies are listed 'Best First'.
Re^3: A profiling surprise ...
by dragonchild (Archbishop) on May 24, 2008 at 00:28 UTC
    The key isn't to reduce the number of database calls. It's to reduce the overall impact of those calls. Let's say that it takes 5 seconds to calculate one of these things, of which 4 seconds is finding and retrieving data. Now, let's say you could rewrite how you retrieve the data to take 3 seconds to retrieve and only .5 seconds to work with. So, 5 seconds drops to 3.5 seconds. Now, let's say that you could do 10 of these in the same 3.5 seconds.

    This isn't just idle speculation. Over the years, I've done 99% and even 99.99% improvements in DB-bound programs. A lot of it has to do with how you store the data. Just because you collect it in one form doesn't mean you search it in that form.

    My criteria for good software:
    1. Does it work?
    2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (4)
As of 2021-10-20 13:19 GMT
Find Nodes?
    Voting Booth?
    My first memorable Perl project was:

    Results (81 votes). Check out past polls.