Yet another fork/parent-child relationship question. I've read the IPC docs and search perlmonks for answers, but I'm coming up a little short. My dilemma: I've got 4 databases to search and I'd like to do it concurrently. I've build a script that searches the 4 dbs using flat files and processes in the background, but it is more than a little messy. I'd like to have a process spawn 4 children, have them perform the necessary db connects/queries/disconnects, and then return the results (array of hash refs?) to the parent to be sorted.
I found the following code posted by mikfire (
here) and modified it some; I've
gotten it to perform the connections and grab the results, but I'm having problems retaining the data in any type of structure once the child dies (I can print it out immediately, tho). Ideally I'd like to combine all of the arrays and sort them based on the hash keys. Is this possible?