Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot

Re^2: search through hash for date in a range

by QM (Parson)
on Mar 07, 2018 at 13:27 UTC ( #1210451=note: print w/replies, xml ) Need Help??

in reply to Re: search through hash for date in a range
in thread search through hash for date in a range

Also, I can't really believe that this I/O bound procedure would in any way be impacted by the number of nanoseconds required to manipulate the dates.

Never underestimate the impact of a large number of subroutine calls.

Given the OP's followup, it seems there's a lot going on in the original code.

Quantum Mechanics: The dreams stuff is made of

  • Comment on Re^2: search through hash for date in a range

Replies are listed 'Best First'.
Re^3: search through hash for date in a range
by bfdi533 (Friar) on Mar 07, 2018 at 15:04 UTC

    Yes, there is a lot going on. Details on the problem and discussion on solutions are in an earlier post from me:

    But, introducing the has range lookup was Terrible for the performance as it meant I had to call a sub, search through about 500 hash items, return if found; AND it had to do this for between 250,000 and 500,000 items each run. If you look at my stats output, you will see this was taking about (edited numbers to reflect actual data) an average of 120 seconds per 1000.

    Changing to the array lookup was a HUGE increase in speed knocking the per 1000 time to 5-7 seconds.

    With all of the other stuff going on, it is a performance nightmare ... Every little bit counts.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (2)
As of 2021-02-25 02:09 GMT
Find Nodes?
    Voting Booth?

    No recent polls found