Subject | Re: [Firebird-Architect] Indexing tales - part 1 - Siblings |
---|---|
Author | Jim Starkey |
Post date | 2006-10-09T11:43:44Z |
m_theologos wrote:
nothing more than a case insensitive substring search. It is not word
based and can't be indexed.
Full context text search is quite a different beast. It is
straightforward (and quite efficient) to implement as a btree, but
rather than encoding record number, it must carry <table, field, record,
word position> to enable cross table, phrase, and proximity weighting.
Historically, database guys don't "get" search. You're never going to
get any where trying to convince them you have a better way to handle
the index (I don't think you do) until you convince them that there is a
difference between full context word search and "containing". Good luck.
> - ...In optimizing the CONTAINING predicate. Perhaps is necessary toI'm afraid you don't understand the "containing" predicate. It is
> have a few words on this:
>
>
nothing more than a case insensitive substring search. It is not word
based and can't be indexed.
Full context text search is quite a different beast. It is
straightforward (and quite efficient) to implement as a btree, but
rather than encoding record number, it must carry <table, field, record,
word position> to enable cross table, phrase, and proximity weighting.
Historically, database guys don't "get" search. You're never going to
get any where trying to convince them you have a better way to handle
the index (I don't think you do) until you convince them that there is a
difference between full context word search and "containing". Good luck.