My earlier response implied that deletes and updates would cause additional sort
overhead on multiple paths.  Thanks to Jerry Fochtman for reminding me that
DBDELETE only relinks forward and backward pointers - it don't resort the chains
- and DBUPDATE w/CIUPDATE only affects the path being changed.
----
Lee Gunter                    The Regence Group
Supervisor, TRG HP/MPE Systems     503.375.4498
----
Opinions expressed are solely mine.




From: "Grunwald, Wyell C." <[log in to unmask]> on 03/08/2000 06:35 AM

Please respond to "Grunwald, Wyell C." <[log in to unmask]>


To:   [log in to unmask]
cc:    (bcc: Lee Gunter/BCBSO/TBG)

Subject:  Re: [HP3000-L] sorting image data




Certainly !  Just add the sort with ADAGER.  Since the sorted item
(Catalogue-number) is already a search item, this is not a problem.  If
Catalogue number was not a search item, this would be a problem because any
change programmatically to the catalogue number would require a put / delete
or critical item update.  Since this is already the case, adding a sort will
not cause a problem.  Beware that if you add the sort to all three items
below, that your performance on puts is going to slow way down if you have a
large number of detail dataset entries.

> -----Original Message-----
> From: bill grefe [SMTP:[log in to unmask]]
> Sent: Wednesday, March 08, 2000 9:26 AM
> To:   [log in to unmask]
> Subject:      sorting image data
>
> I have an image data set(see below). I would like to have this data
> returned
> from image sorted by
> Catalogue-number regardless of the search path used to find the data.  The
> programs that use this
> Data set are supplied by a third party and I have no access to them.
> Can I a) add a sort path with adager to catalogue-number (without breaking
> anything) or
>           b) sort the data with adager periodically

<snipped>