Result: 2Nor

options

HTML
TEXT
STATS

exclusive	inclusive	rows x	rows	loops	node
0.000	0.000	↓ 0.0			→ Hash Join (cost=85.45..365.20 rows=100 width=57) (actual time=.. rows= loops=) Hash Cond: (roles.id = carings.child_id)
0.000	0.000	↓ 0.0			→ Seq Scan on roles (cost=0.00..241.25 rows=10000 width=57) (actual time=.. rows= loops=) Filter: ((deleted_at IS NULL) AND (type = 'Child'::text))
0.000	0.000	↓ 0.0			→ Hash (cost=84.20..84.20 rows=100 width=4) (actual time=.. rows= loops=)
0.000	0.000	↓ 0.0			→ Bitmap Heap Scan on carings (cost=5.03..84.20 rows=100 width=4) (actual time=.. rows= loops=) Recheck Cond: (caregiver_id = 1) Filter: (deleted_at IS NULL)
0.000	0.000	↓ 0.0			→ Bitmap Index Scan on index_carings_on_caregiver_id_and_child_id (cost=0.00..5.00 rows=100 width=0) (actual time=.. rows= loops=) Index Cond: (caregiver_id = 1)

 Hash Join  (cost=85.45..365.20 rows=100 width=57)
   Hash Cond: (roles.id = carings.child_id)
   ->  Seq Scan on roles  (cost=0.00..241.25 rows=10000 width=57)
         Filter: ((deleted_at IS NULL) AND (type = 'Child'::text))
   ->  Hash  (cost=84.20..84.20 rows=100 width=4)
         ->  Bitmap Heap Scan on carings  (cost=5.03..84.20 rows=100 width=4)
               Recheck Cond: (caregiver_id = 1)
               Filter: (deleted_at IS NULL)
               ->  Bitmap Index Scan on index_carings_on_caregiver_id_and_child_id  (cost=0.00..5.00 rows=100 width=0)
                     Index Cond: (caregiver_id = 1)

Per node type stats

node type	count	sum of times	% of query
Bitmap Heap Scan	1	0.000 ms	0.0 %
Bitmap Index Scan	1	0.000 ms	0.0 %
Hash	1	0.000 ms	0.0 %
Hash Join	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
carings	1	0.000 ms	0.0 %
Bitmap Heap Scan	1	0.000 ms	0.0 %
roles	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: 2Nor

Colorize:

Columns visibility:

Per node type stats

Per table stats