I searched in dfsort forum for it and it looks like this is the case of cartesian join.
And replies on such topics tells
cant be done using splice (dfsort)
what will be best suited to do so?
any thoughts/suggestions?
Hi Kolusu...
Thanks a lot...
I tried this solution for 10% of records then works fine but when i tried with actual file it is failing with EB37 on tmp file
I tried increasing space but still result was same..
Joined: 17 Oct 2006 Posts: 2481 Location: @my desk
Sambhaji,
The logic used here involves repeating 'n' times the records in file-2, where 'n' is the maximum number of duplicates in file-1 and storing it in T1. It would be better if you post the actual number of input records and the value of 'n' from your job run(Search for REPEAT in your DFSMSG output).
Joined: 07 Dec 2007 Posts: 2205 Location: San Jose
Sambhaji,
Your input files are huge. I do not think the REPEAT solution is viable for this job as we are repeating every record 69 times. Your input count shows more than 11 million and the repeat solution would create roughly about 826 million records which is the reason for your SB37 errors.
We have an COBOL program for such requests. Please contact me via e-mail offline (skolusu@us.ibm.com). Make sure that you send me the following details
1. LRECL and RECFM of both files
2. Position of the key and format in both files
3. OUTPUT file layout ( what fileds do you need to pick from file 1 and file 2)
4. Do you also need the unmatched records from both files?