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

Re^2: Fast seeking in a large array of hashes to generate a report.

by jbrugger (Parson)
on Jun 23, 2005 at 11:05 UTC ( #469358=note: print w/ replies, xml ) Need Help??


in reply to Re: Fast seeking in a large array of hashes to generate a report.
in thread Fast seeking in a large array of hashes to generate a report.

Yes i know how to use DBI and a database.
As stated before, the problem i get when i use sql, is that i create a monsterous sql with inner, outer left and rigt joins, if -statemetns( not fast) and 100'ds of where statements.
The database is big, and the structure complex, the problem as described here, is only a simple representation of the real situation.

"We all agree on the necessity of compromise. We just can't agree on when it's necessary to compromise." - Larry Wall.


Comment on Re^2: Fast seeking in a large array of hashes to generate a report.
Re^3: Fast seeking in a large array of hashes to generate a report.
by srdst13 (Pilgrim) on Jun 23, 2005 at 20:52 UTC
    Sorry. Despite your explanation above, I didn't really grasp the complexity of the problem. Thanks for clarifying....

    Sean

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2015-07-07 08:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (87 votes), past polls