Re: Sorting

We have many applications that dynamic sort data from
files using OPNQRYF and they work fine.  SQL is
another option, we don't have it so not as familiar
with using it.  We also dynamically sort data inside
programs with qsort but have found for large sets of
data it is best to use a file in QTEMP.  Some
applications build a work file in QTEMP and then
dynamically sort it with OPNQRYF.  Whether using
OPNQRYF or SQL, performance can sometimes be helped by
building some logicals.

Scott Mildenberger
--- "Metz, Zak" <Zak_Metz@xxxxxx> wrote:
> I need to sort some files. The sorts are dynamic and
> the keying will
> only be known at run-time. The files often have
> multi-million record
> counts and an average reclen of something like 1k.
> 
> I will be starting with a PF and need to either sort
> into a 2nd PF or
> preferably back into the same PF. Those are
> requirements that I have no
> control over.
> 
> Currently this is done with FMTDTA, but we are
> running into the key
> length limitation, and so looking for other
> solutions.
> 


__________________________________
Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo.
http://search.yahoo.com