Roberto R. wrote on 04/27/2006 02:41:12 AM: > I believe that Mike's cartesian join description fits well with the pattern > I see in the input data, so if that is the case, can DFSORT help me or does > it require more sophisticated tools? Thank you all again.
Cartesian join for a large maximum number of duplicates is not practical with DFSORT. However, FWIW, Kolusu Srihari from mvsforums recently came up with a "DFSORT Trick" that can be used for a cartesian join with a limited maximum number of duplicates. You can find his solution and my refinement of it at: http://www.mvsforums.com/helpboards/viewtopic.php?t=6271 Frank Yaeger - DFSORT Team (IBM) Specialties: PARSE, JFY, SQZ, ICETOOL, IFTHEN, OVERLAY, Symbols, Migration => DFSORT/MVS is on the Web at http://www.ibm.com/storage/dfsort/ ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO Search the archives at http://bama.ua.edu/archives/ibm-main.html
