RE: Sorting

I would probably use embedded SQL.  You could also update a source member
and then use the RUNSQLSTM command to execute it.  That seems like extra
work to me though.

Is there any way to determine if particular fields are used in the sort more
frequently than others?  Anything that could be done in the way of indexing
will help.  Maybe you could log the selection requests to a file and look at
it for patterns.  If you do decide to create any indexes I would suggest
using SQL to create them.  SQL indexes use a larger buffer than DDS indexes.

It's too bad you don't have a fixed number of key fields I liked the QMQRY
suggestion earlier.

Rick

-----Original Message-----
From: Metz, Zak [mailto:Zak_Metz@xxxxxx]
Sent: Wednesday, April 30, 2003 2:06 PM
To: Midrange Systems Technical Discussion
Subject: RE: Sorting
If I were to use SQL, what is the most straightforward way to build the
SQL string and run it? Would that be embedded SQL with a prepare? If so,
I have no objection, or enlighten me of a better way?