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

Re: Disk based hash (as opposed to RAM based)

by techtruth (Novice)
on Oct 09, 2012 at 03:18 UTC ( #997913=note: print w/ replies, xml ) Need Help??


in reply to Disk based hash (as opposed to RAM based)

After asking myself a series of questions about how best to do this, I believe that the best way is to load everything into a temporary database table and use the database to process all this data. I would love to use perls hashes (which is initially why I chose perl) but this approach should be the best I can come up with. I will post the code once I finish it. I am rolling my own code on this one and am not using an API or other library of code other than perl and MySQL. My thought is to load the data, and use a combination of mysqls left, substr, and other string functions to populate data in a second column with the values I would use as a key. The MySQL select...where should let me then retrieve data in a way that mirrors perls way of getting values from a hash by key. Does that make sense? I will post code later.


Comment on Re: Disk based hash (as opposed to RAM based)
Re^2: Disk based hash (as opposed to RAM based)
by Anonymous Monk on Oct 11, 2012 at 01:14 UTC
    I have ventured a little farther into mysql land than I wanted to, Still working on an issue or two that isn't relevant to the monastery, I will return.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (15)
As of 2014-07-22 16:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (119 votes), past polls