#	exclusive	inclusive	rows x	rows	loops	node
1.	76.360	20550.817	↑ 1.0	8761	1	→ Seq Scan on test1 t1 (cost=0.00..3574037.50 rows=8761 width=4) (actual time=3.343..20550.817 rows=8761 loops=1)
2.						SubPlan (forSeq Scan)
3.	148.937	10364.263	↑ 1.0	1	8761	→ Aggregate (cost=203.96..203.97 rows=1 width=4) (actual time=1.183..1.183 rows=1 loops=8761)
4.	6553.228	10215.326	↓ 0.0	0	8761	→ Bitmap Heap Scan on test2 t2 (cost=36.49..203.95 rows=1 width=4) (actual time=1.100..1.166 rows=0 loops=8761) Recheck Cond: ((category)::text = 'A'::text) Filter: (test1_id = $0)
5.	3662.098	3662.098	↑ 1.0	1631	8761	→ Bitmap Index Scan on test_category_idx (cost=0.00..36.49 rows=1631 width=0) (actual time=0.418..0.418 rows=1631 loops=8761) Index Cond: ((category)::text = 'A'::text)
6.	96.371	10110.194	↑ 1.0	1	8761	→ Aggregate (cost=203.96..203.97 rows=1 width=4) (actual time=1.154..1.154 rows=1 loops=8761)
7.	6281.637	10013.823	↓ 0.0	0	8761	→ Bitmap Heap Scan on test2 t2 (cost=36.49..203.95 rows=1 width=4) (actual time=1.083..1.143 rows=0 loops=8761) Recheck Cond: ((category)::text = 'A'::text) Filter: (test1_id = $0)
8.	3732.186	3732.186	↑ 1.0	1631	8761	→ Bitmap Index Scan on test_category_idx (cost=0.00..36.49 rows=1631 width=0) (actual time=0.426..0.426 rows=1631 loops=8761) Index Cond: ((category)::text = 'A'::text)

Seq Scan on test1 t1  (cost=0.00..3574037.50 rows=8761 width=4) (actual time=3.343..20550.817 rows=8761 loops=1)
   SubPlan 1
     ->  Aggregate  (cost=203.96..203.97 rows=1 width=4) (actual time=1.183..1.183 rows=1 loops=8761)
           ->  Bitmap Heap Scan on test2 t2  (cost=36.49..203.95 rows=1 width=4) (actual time=1.100..1.166 rows=0 loops=8761)
                 Recheck Cond: ((category)::text = 'A'::text)
                 Filter: (test1_id = $0)
                 ->  Bitmap Index Scan on test_category_idx  (cost=0.00..36.49 rows=1631 width=0) (actual time=0.418..0.418 rows=1631 loops=8761)
                       Index Cond: ((category)::text = 'A'::text)
   SubPlan 2
     ->  Aggregate  (cost=203.96..203.97 rows=1 width=4) (actual time=1.154..1.154 rows=1 loops=8761)
           ->  Bitmap Heap Scan on test2 t2  (cost=36.49..203.95 rows=1 width=4) (actual time=1.083..1.143 rows=0 loops=8761)
                 Recheck Cond: ((category)::text = 'A'::text)
                 Filter: (test1_id = $0)
                 ->  Bitmap Index Scan on test_category_idx  (cost=0.00..36.49 rows=1631 width=0) (actual time=0.426..0.426 rows=1631 loops=8761)
                       Index Cond: ((category)::text = 'A'::text)

Per node type stats

node type	count	sum of times	% of query
Aggregate	2	245.308 ms	1.2 %
Bitmap Heap Scan	2	12834.865 ms	62.5 %
Bitmap Index Scan	2	7394.284 ms	36.0 %
Seq Scan	1	76.360 ms	0.4 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
test1	1	76.360 ms	0.4 %
Seq Scan	1	76.360 ms	100.0 %
test2	2	12834.865 ms	62.5 %
Bitmap Heap Scan	2	12834.865 ms	100.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: kD0

Colorize:

Columns visibility:

Per node type stats

Per table stats