At 03:38 PM 6/10/03 +0000, Roman Rokytskyy wrote:

>Jim,
>
> > Netfrastructure has B-Tree based full text search and it works
> > superbly well. When you do an IBPhoenix.com knowledge-base search,
> > you're using a B-Tree based full text search.
>
>a) How do you solve word similarity search (including stemming),
>thesaurus lookup, etc. with your index? Is it some kind of special
>text search index that uses B-Tree for storage or you use the same
>index structure as for any other data type?
>
>b) What happens if your search condition contains many ANDs? How do
>you join indices? Are there any tricks?

I'd rather not talk about it. Sorry.

Jim Starkey