Jordi <jmaillists@xxxxxxxxxx> writes: > I've been trying to get a query use indexes and it has raised a doubt > whether pgsql supports bitmap and-ing between a multi-column btree index > and a gin index. Sure. But such a plan would give an unordered result, meaning that we'd have to process the whole table before doing the ORDER BY/LIMIT. The planner evidently thinks that it's better to try to process the rows in ID order so it can stop as soon as it's got 100. If it's wrong about that, that's likely because it's got a bad estimate of the selectivity of the other WHERE conditions. You might see if you can improve the statistics for the search_vector column. regards, tom lane -- Sent via pgsql-performance mailing list (pgsql-performance@xxxxxxxxxxxxxx) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
