HP3000-L Archives

August 2000, Week 2

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:
Stan Sieler <[log in to unmask]>
Reply To:
Stan Sieler <[log in to unmask]>
Date:
Tue, 8 Aug 2000 10:57:09 -0700
Content-Type:
text/plain
Parts/Attachments:
text/plain (20 lines)
Re:
>
> Since I was updating a series of credit cards from one tape supplier from a flat file, then if a could preload all the GMAC accounts into memory, then very few access would be made to disk.

I'd consider doing two other things, possibly in addition:

1) sort the flat file first

2) use ADAGER to sort the associated detail dataset(s) (if any)


I'm not sure B-Trees will be of much help ... you're not trying to find what
keys match a pattern ... you *have* the key in your hand!  Essentially,
the B-Tree simply provides a quick way of determining if a particular
key is in the master dataset, or if a particular pattern (e.g., GMAC@)
matches any keys (and, if so, which keys).

Stan Sieler                                           [log in to unmask]
www.allegro.com/sieler/wanted/index.html          www.allegro.com/sieler

ATOM RSS1 RSS2