[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] bad COPY performance with NOTIFY in a trigger

=?UTF-8?Q?Filip_Rembia=C5=82kowski?= writes: > A table has a trigger. > The trigger sends a NOTIFY. > Test with COPY FROM shows non-linear correlation between number of inserted > rows and COPY duration. No surprise, see AsyncExistsPendingNotify. You would have a

[PERFORM] bad COPY performance with NOTIFY in a trigger

Hi. A table has a trigger. The trigger sends a NOTIFY. Test with COPY FROM shows non-linear correlation between number of inserted rows and COPY duration. Table "test.tab" Column | Type | Modifiers

[PERFORM] Understanding ANALYZE memory usage with "big" tsvector columns

Hi, I'm trying to understand how to estimate and minimize memory consumption of ANALYZE operations on "big" tsvector columns. Context: Postgresql server is 9.1.19 (Ubuntu package 9.1.19-0ubuntu0.12.04). I have a database on which I noticed that autovacuum operations could consume up to 2 GB of

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