id matching

[Frank J. Beckmann]

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.

Frank