>> Um, no. >> >> Two file matches don't work too well without a sort. > > Not true. Comparex, for example, permits definition of "random order" keys > with no pre-sorting of files to be compared, and will very accurately tell > you where records are inserted or deleted as well as equal-key records with > differing data. >
If Comparex does this without any sorting, it must have limits. Sort and compare is the lowest, KISS way to achieve this. The language is irrelevant for the process. I nominated REXX because of the simple integration with ISPF but obviously that has limits on the size of dataset that can be brought into memory etc. >> It all could be done in DB2 using INSERT and report duplicates though. > > Ouch! Talk about an expensive solution... > Comparex is free? Cheap? My copy of DB2 Personal edition was free and FTP and disk space on my laptop is real cheap. Just bought a terabyte for $75. > Peter > > > This message and any attachments are intended only for the use of the > addressee and > may contain information that is privileged and confidential. If the reader of > the > message is not the intended recipient or an authorized representative of the > intended recipient, you are hereby notified that any dissemination of this > communication is strictly prohibited. If you have received this communication > in > error, please notify us immediately by e-mail and delete the message and any > attachments from your system. > > > ---------------------------------------------------------------------- > 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 > -- Wayne V. Bickerdike ---------------------------------------------------------------------- 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
