On Monday 13 July 2009 16:38:18 Bruce Momjian wrote: > Heikki Linnakangas wrote: > > Even if we don't solve the visibility > > map problem, just allowing the executor to evaluate quals that are not > > directly indexable using data from the index, would be useful. For > > example, "SELECT * FROM foo WHERE textcol LIKE '%bar%', and you have a > > b-tree index on textcol, the planner could choose a full-index-scan, > > apply the '%bar%' filter on the index tuples, and only fetch those heap > > tuples that match that qual. > > Interesting, I had not considered that. You are using the index as a > single-column table that can be scanned more quickly than the heap.
On slightly bizarre application of this could be that you create a poor man's column storage by creating heap "indexes" on tables. These would just be narrower copies of the original heap, but allow faster fetching. This might actually be useful for data types that don't support btree indexing. -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
