How dare you post on topic message?

Since you will be doing updates in batch (I suspect a mass of DBPUTs,) I
would not worry about the paths.  I would design and create the database as
you want to use it (i.e. fast and varied retrievals) and let fly.

I would only be concerned if the batch job took way too long to do the work
and would interfere with other operations.

Denys

-----Original Message-----
From: HP-3000 Systems Discussion [mailto:[log in to unmask]]On Behalf Of
Michael Anderson
Sent: Wednesday, February 12, 2003 12:26 PM
To: [log in to unmask]
Subject: Skipper for Image and V-Plus

Hello to all,

Quick question;

I am in the process of designing an Image database, for quick day-time
inquiry, batch updates run at night. Because of this kind of database
usage, and the fact that it is mainly static historical data, and fast
retrieval is the number one requirement. I have used lots of paths,
including sorted paths. So called experts tell me all the time, not to
used too many paths, and never sorted paths. I disagree with
unconditional rules,  Like Never! Why is it that Image has sorted paths?
Like: Lets design in a feature, and tell everyone to avoid it at all
cost, doh. I understand the overhead, but that's only during
DBPUT,DBDELETE, right? Just looking at and old 1984 article that made
mention of Skipper. Has anyone ever used Skipper, a COBOL interface for
Image (on-the-fly chain sorts). I am curious about it, what it is, or
was, anyone know of this?

Would it be a wiser use of resources if I remove all paths before the
nightly batch updates, and re-add the paths when the batch updates are
complete? And of course I am referring to using ADAGER!





--
Michael Anderson
Spring Independent School District
16717 Ella Boulevard
Houston, Texas 77090-4299
office: 281.586.1105
fax: 281.586.1187
-

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

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