> > 2) Would there be work in the optimizer to get it to recognize that > > there was an index that helped with the CONTAINS() function. Is this > > the sort of work needed for DERBY-455 creation of indexes on expressions? > > Possibly. > > Dan. >
I would think that each secondary access method would have a set of functions that could be used to read from the index. Much like BTree has <, <=, = and others, a text index would have CONTAINS (maybe others). The optimizer would have to know that CONTAINS is one of the functions supported by the index and to consider the access path when considering query plans. Manish
