6e2f3ae884
Unlike Btree-based LIKE optimization, this works for non-left-anchored search patterns. The effectiveness of the search depends on how many trigrams can be extracted from the pattern. (The worst case, with no trigrams, degrades to a full-table scan, so this isn't a panacea. But it can be very useful.) Alexander Korotkov, reviewed by Jan Urbanski |
||
|---|---|---|
| .. | ||
| data | ||
| expected | ||
| sql | ||
| .gitignore | ||
| Makefile | ||
| pg_trgm.sql.in | ||
| trgm.h | ||
| trgm_gin.c | ||
| trgm_gist.c | ||
| trgm_op.c | ||
| uninstall_pg_trgm.sql | ||