Re: Thanks: TurboIMAGE B-Tree indices
- From: "Walter J. Murray" <wmurray@xxxxxxxxxxxx>
- Date: Sun, 12 Oct 2008 20:43:57 -0700
Paul wrote:
Walter, after a DBFIND, check the value in the status array of the
CHAIN-COUNT element(4th) for zero. If so, there are no records in that
chain in the detail. I always do this to avoid an unnecessary DBGETand
the associated disk I/O.
A couple of thoughts here.
1. In the situation I was describing, I had done a high-speed (mode 24)
B-Tree DBFIND, followed by a traversal of the super-chain. I don't
think the technique Paul describes would apply in that case.
2. In the case of a non-B-Tree DBFIND, yes, checking the chain count
can help avoid an unnecessary call to DBGET. But I wonder whether that
would actually avoid any disc I/O. Since the internally maintained
forward (and backward) pointer would be zero, I would expect IMAGE to
return immediately with an end-of-chain status, with no need for any
disc I/O.
Walter
Walter J. Murray
* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *
.
- References:
- Re: Thanks: TurboIMAGE B-Tree indices
- From: Paul Edwards
- Re: Thanks: TurboIMAGE B-Tree indices
- Prev by Date: Re: Thanks: TurboIMAGE B-Tree indices
- Next by Date: Re: OT: Friday Humo(u)r
- Previous by thread: Re: Thanks: TurboIMAGE B-Tree indices
- Index(es):
Relevant Pages
|
Loading