in reply to Re^4: Moving from hashing to tie-ing.
in thread Moving from hashing to tie-ing.

Limbic,

I apologize; I'm trying :) This is a little challenging since I am also learning.

The basic programming process is explained in my reply to BrowerUk. It's that simple, but it deals with a lot of information. The problem is with step 2 because it hashes all of the data provided, when the script may only need a fraction of it.

To reiterate: Correct. The whole lookup is not needed for processing. The pins that are needed could be determined by reading all of the pins in the source file; the largest one is around 25MB, 40,000 lines. If the file was only using the pins 123, 456, and 789, I could only look for these in the other file to hash.

Replies are listed 'Best First'.
Re^6: Moving from hashing to tie-ing.
by Limbic~Region (Chancellor) on Aug 01, 2006 at 12:26 UTC
    eff_i_g,
    I am afraid after reading your reply to BrowserUk, I am still left wondering about how the program works. You speak in terms as though we understand what you are talking about. What do you mean by section and how is it determined? This isn't really a question I want you to answer because I am sure it will just lead to more questions.

    I am afraid you just aren't providing the technical details necessary to help. I believe the only way that I personally am going to be able to help is if you were to provide a sample of the data (masking sensitive info is fine but it must be representative of the real data), the code that is processing it, and an example of how it is invoked.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom