I have some SAS that will also do it, but it isn't really a one pass process.
Dave Gibney [EMAIL PROTECTED] System Programmer (509) 335-7359 Information Technology Washington State University Pullman, WA 99164-1222 > -----Original Message----- > From: IBM Mainframe Discussion List [mailto:[EMAIL PROTECTED] On > Behalf Of Frank Yaeger > Sent: Thursday, April 27, 2006 8:00 AM > To: [email protected] > Subject: Re: DFSORT match problem > > 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 ---------------------------------------------------------------------- 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
