I would definitely put the unique key into a searchable store then process the other file in current order. Or is there a report that needs to be in a certain order.
On Thu, Oct 4, 2012 at 6:47 PM, David Speake <david.spe...@bcbssc.com> wrote: > One of my application programmers asked for information on design decision. > > Given two files that are not in order by the match key. > Assuming the smaller file has at most one record per possible key value. > Larger file may have multiple records for some keys and may also have values > not found in the smaller file. > Assume optimal blocking, buffering, both files, both solutions. > Which is more efficient? > <delete> -- Mike A Schwab, Springfield IL USA Where do Forest Rangers go to get away from it all? ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
