Eben,

>With regard to the REPACK DATASET option, I would like to know the
>difference between the SORTED+ and CHAINED+ options, IF the
>reorganization takes place based upon the primary index key in a detail
>dataset.  In other words, if I select SORTED+ and tell it to repack
>based upon the primary index key in a detail dataset, how does that
>differ from selecting CHAINED+ and repacking based upon the primary
>index key in the detail dataset?


The Chained option repacks detail entries with like search field values
physically adjacent on disc while maintaining their chronology.  The final
order of the search field value groupings in the detail is determined by
the master's physical order.

The Sorted option repacks detail entries based upon the 'sort key's value'
(you can choose any field in the set as a sort and up to 4 fields).

In your query, you ask about using the primary path's value as the 'sort' key.
That would repack the detail as chained optimization would plus it would
produce a physical sort of the detail based upon the sort key's value.

Although the sorted option was created to repack the detail for optimizing
serial access, you may use it as you describe, however.  From a point of
view of system resourses and elapsed time, the sorted repack would be an
order of magnitude or two greater than repacking with the chained option.

If your intent is to optimize chained reads, I would suggest that you use
the 'chained' option which Adager offers as a default.

Hopes this answers your question.

Patrick
 _______________
|               |
|               |
|            r  |  Patrick                   [log in to unmask]
|          e    |                            http://www.adager.com
|        g      |  Patrick Mullen
|      a        |  R & D Labs / Technical Support
|    d          |  Adager Corporation
|  A            |  Sun Valley, Idaho 83353-3000             U.S.A.
|               |
|_______________|

* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *