Re: [PERFORM] Bitmap and-ing between btree and gin?

On Thu, Feb 4, 2016 at 9:19 AM, Jordi wrote: The custom here is to respond in line, not to top-post. Thanks. > > So basically you're saying it's hard to do sorting in any way when a gin > index is involved? Neither with a complete multi-column btree_gin index > because

[PERFORM] Bitmap and-ing between btree and gin?

Hello all, 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. The idea is to do a full-text search on a tsvector that is indexed with gin. Then there are typical extra filters like

Re: [PERFORM] Bitmap and-ing between btree and gin?

Jordi 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

Re: [PERFORM] Bitmap and-ing between btree and gin?

Hi Tom, thanks for your reply, much appreciated. So basically you're saying it's hard to do sorting in any way when a gin index is involved? Neither with a complete multi-column btree_gin index because it doesn't support sorting per definition, nor with a seperate gin and btree because there