David,
What is the ultimate destination. Choose a method that will best arrive
at that destination.
If it a DB2 than use DB2. If a VSAM KSDS than load from one file and
update with the other acknowledging that you need processing for the
duplicates. If a sequential transaction file then merge in a manner that
mkes subsequent processing simple.
Ken
On Thu, Oct 4, 2012 at 6:47 PM, David Speake <[email protected]>
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>
--
Ken
Mob: 0409 009 764
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN