Re: DFSORT match problem

2006-04-27 Thread Schneiderwent, Craig
: DFSORT match problem 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

Re: DFSORT match problem

2006-04-27 Thread Frank Yaeger
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

Re: DFSORT match problem

2006-04-27 Thread Gibney, Dave
- From: IBM Mainframe Discussion List [mailto:[EMAIL PROTECTED] On Behalf Of Frank Yaeger Sent: Thursday, April 27, 2006 8:00 AM To: IBM-MAIN@BAMA.UA.EDU 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

Re: DFSORT match problem

2006-04-26 Thread Roberto R.
Thank you, Frank, your suggestion worked for a while until I stumbled over a different set of record combinations, which I try to illustrate like this: Input1: A1 A1 A1 X1 A1 X2 Input2: A1 123 X1 123 X1 ABC Expected output: A1 A1 123 A1 X1 123 A1 X1 ABC i.e. the second column in

Re: DFSORT match problem

2006-04-26 Thread Frank Yaeger
Roberto R. wrote on 04/26/2006 08:06:33 AM: Thank you, Frank, your suggestion worked for a while until I stumbled over a different set of record combinations, which I try to illustrate like this: Input1: A1 A1 A1 X1 A1 X2 Input2: A1 123 X1 123 X1 ABC Expected output: A1 A1

Re: DFSORT match problem

2006-04-26 Thread Roberto R.
If I understand this correctly I need a different solution depending on if I have duplicates in input1 or input2, is this true? My situation is that input1 consists of roughly 10.000 records and input2 about 350.000 records, and I have no idea how or where duplicates exist. I take this as there

Re: DFSORT match problem

2006-04-26 Thread Knutson, Sam
:[EMAIL PROTECTED] On Behalf Of Roberto R. Sent: Wednesday, April 26, 2006 6:23 PM To: IBM-MAIN@BAMA.UA.EDU Subject: Re: DFSORT match problem If I understand this correctly I need a different solution depending on if I have duplicates in input1 or input2, is this true? My situation is that input1

Re: DFSORT match problem

2006-04-26 Thread Frank Yaeger
Roberto R. wrote on 04/26/2006 03:23:20 PM: If I understand this correctly I need a different solution depending on if I have duplicates in input1 or input2, is this true? My situation is that input1 consists of roughly 10.000 records and input2 about 350.000 records, and I have no idea how

Re: DFSORT match problem

2006-04-26 Thread Mike Bell
or you could load it to DB2 and use SQL to get the cartesian join (the SQL people get excited about calling a many to many merge by different names) select tab1col1, tab1col2, tab2col2 from input1 inner join input2 on tab1col2 = tab2col1. The cartesian join will match duplicate keys from either

DFSORT match problem

2006-04-25 Thread Roberto R.
Hello, is it possible to do the following with DFSORT/ICETOOL: Input1: A1 X1 A1 X2 B1 X1 B1 Y1 Input2: X1 ABC X2 DEF Y1 GHI Expected output: A1 X1 ABC A1 X2 DEF B1 X1 ABC B1 Y1 GHI I believe it will require multiple scans of Input2. Hope it is clear enough. Thanks.

Re: DFSORT match problem

2006-04-25 Thread Frank Yaeger
Roberto R. wrote on 04/25/2006 05:56:22 AM: Hello, is it possible to do the following with DFSORT/ICETOOL: Input1: A1 X1 A1 X2 B1 X1 B1 Y1 Input2: X1 ABC X2 DEF Y1 GHI Expected output: A1 X1 ABC A1 X2 DEF B1 X1 ABC B1 Y1 GHI I believe it will require multiple