Teju Jakkidi vlogs <teja.jakkidi05@xxxxxxxxx> writes:
> We have a query as below which uses the levenshtein function to compare
> strings.
> SELECT "name", levenshtein("name",'some string') as p FROM table1
> where levenshtein("name",'some string') <= 2 order by p desc;
> We have a GIST index built on top of this table as below:
> CREATE INDEX gist_idx ON table1 USING GIST("name");
AFAIK, that index is completely useless for this query. I don't
really see a good way to index it either --- "levenshtein distance
less than X" seems like a not very tractable requirement. Can
you formulate your matching rules some other way?
regards, tom lane
