[This note has been sent to the following InterNet address(es):
HP3000-L @ UTCVM.UTC.EDU]
 
 
Hi all
 
I am looking for a book or some reference on techniques for efficient
indexing of a LARGE number of keys of variable length. Is b-tree
(as in KSAM) still the latest and greatest, or is there something
more up to date. I know KSAM on HP reasonably well, but what techniques
are used by the likes of Paradox, Access etc ?
If anyone can give me pointers to some good reference material on this,
or perhaps has opinions on the subject, I would be most grateful
to hear from you.
 
Regards/Tad
 
[log in to unmask]
[log in to unmask]