david at eos.lugs.ch
Sat Oct 31 18:03:51 CET 1998
On Fri, 30 Oct 1998 21:37:58 +0100 "Frank J. Beckmann" wrote:
> On Fri, Oct 30, 1998 at 07:09:37PM +0100, Werner Koch wrote:
> > BTW, I need a clever algorithms to store strings in a DB and do
> > a substring search. I don't wan't to do a sequentiell search, but I
> > doubt that there is any other way (without building an index which is
> > not good because I have to insert many new items - or use a overflow
> > list until the next index run?).
> How about a btree? They work also on disk.
Good idea. The BSD db-library provides a BTree-interface.
David Frey (B98D36A9) = 51F35923114FC864 7D05FF173C61EFDE
Those who do not understand Unix are condemned to reinvent it, poorly.
-- Henry Spencer
More information about the Gnupg-devel