HP3000-L Archives

November 1997, Week 1

HP3000-L@RAVEN.UTC.EDU

Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
From:
"John P. Burke" <[log in to unmask]>
Reply To:
John P. Burke
Date:
Thu, 6 Nov 1997 08:57:05 -0800
Content-Type:
text/plain
Parts/Attachments:
text/plain (39 lines)
Before we all try to create a Rube Goldberg solution to your problem,
perhaps we should examine the original premise. Could you tell us why
you think you "need" to add a key with only 5 values when your shortest
chain will likely be at least 4000 records out of 85,000 total?

Hopefully, you do not plan to walk these chains interactively. Assuming
it is a batch process, you are going to be better off using a serial
read and select (especially if you can acquire a third-party tool for
fast serial reads) as Jerry Fochtman suggests.

> -----Original Message-----
> From: John Pearce [SMTP:[log in to unmask]]
> Sent: Wednesday, November 05, 1997 9:23 PM
> To:   [log in to unmask]
> Subject:      Single character Image key
>
> I need to add a new key to an Image detail dataset.  The key is a
> single
> character with five values (0-4).  About 80% of the 85,000 records
> will
> have the same key value (0) and thus a long, long chain.  The
> remaining
> 17,000 records should be spread about equally through the other four
> values
> and still long chains.
>
> I recall someone posted a technique to overcome the long chains
> situation.
> Unfortunately, it appears that was one message I didn't archive. :(
> If
> someone has the original message or knows the technique, could you
> please
> send it to me via e-mail?  Thanks!
>
>
> ------------------------------------------------------------------
> John Pearce  <[log in to unmask]>       | Bethesda Management Company
> Speaking for only myself             | Colorado Springs, CO  USA

ATOM RSS1 RSS2