Greetings,

Being on the cutting edge of HP-3000 technology here at the Department
of Corrections, we are looking into this new-fangled thing in TurboIMAGE
called B-Tree indices.  :-)

I've read the chapter in the IMAGE manual, and it all seems well
documented and straightforward.  What surprises might we encounter when
we start using this feature?

Some specific questions:

*  Does IMAGE do a good job of reliably keeping the index in sync?  Is
there ever a need to rebuild an index?

*  I read that DBSTORE doesn't know about the index files (but then who
uses DBSTORE anyway?).  Does everything else work O.K.?

*  Will I get any nasty surprises relative to performance?  

*  Are there any tutorials on B-Tree indices that would be worth
reading?

*  Are there any gotchas with B-Tree indices in DBGENERAL or ADAGER?

*  Does QUERY know anything about or take advantage of B-Tree indices?

*  I think I found one documentation error.  The manual says that IMAGE
uses KSAM XL files for the indexes, but it looks to me like it's using
KSAM64.  Are there other documentation errors I should know about?

If B-Tree indexes (I hate writing "indices" in this context!) work well,
they might provide a perfect way to implement something I'm working on
right now.

Thanks for any helpful suggestions.

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 *