
> You've apparently forgotten all our previous history on that subject
> :-(.  The above does not work in the presence of special sort rules for
> digraphs, etc.  For example, that LIKE should certainly match ABCH ...
> but there are locales in which "CH" sorts after "D" and would not be
> found by an indexscan that runs from ABC to ABD.

Sorry, so is the start condition of >= 'ABC' also not valid ?

A new index scan method with the pattern as input would need to know when it can 
safely stop (which is the problem I understand), but would have the advantage of 
beeing able to filter unwanted tuples before the heap access.

Andreas


Tue, 13 May 2003 18:48:01 +0200
"Zeugswetter Andreas SB SD" <ZeugswetterA@spardat.at>
Re: LIKE indexing proposal 