Re: Bloom filters and the planner / parallel execution

- > Bitmap Heap Scan on tdummy (cost=506868.00..506872.02 rows=1 width=32) > (actual time=54.085..54.092 rows=1 loops=1) >Recheck Cond: ((a = 1) AND (b = 1) AND (c = 1) AND (d = 1) AND (e = 1)) >Rows Removed by Index Recheck: 1 >Heap Blocks: exact=2 >-> Bitmap Index Scan on bloomidx2 (cost=0.00..506868.00 rows=1 > width=0) (actual time=54.047..54.047 rows=2 loops=1) > Index Cond: ((a = 1) AND (b = 1) AND (c = 1) AND (d = 1) AND (e = > 1)) > Planning Time: 0.165 ms > Execution Time: 54.847 ms > (8 rows) > > Regards > Daniel > > [1] > https://www.postgresql.org/message-id/flat/ZR0P278MB0122119FAE78721A694C30C8D2340%40ZR0P278MB0122.CHEP278.PROD.OUTLOOK.COM > > > -- Regards, Rafia Sabih CYBERTEC PostgreSQL International GmbH

Re: Good afternoon.

nitoring-cpu-memory-usage-from-postgres -- Regards, Rafia Sabih