#	exclusive	inclusive	rows x	rows	loops	node
1.	5132.269	12805.956	↑ 1.0	1068530	1	→ Sort (cost=496188.38..498859.71 rows=1068530 width=56) (actual time=11771.760..12805.956 rows=1068530 loops=1) Sort Key: "_F2".title Sort Method: external merge Disk: 69264kB
2.	2535.329	7673.687	↑ 1.0	1068530	1	→ Hash Right Join (cost=186286.08..357885.09 rows=1068530 width=56) (actual time=4537.462..7673.687 rows=1068530 loops=1) Hash Cond: (("_F2".id)::text = (hierarchy.id)::text)
3.	601.022	601.022	↑ 1.0	1068530	1	→ Seq Scan on dublincore "_F2" (cost=0.00..127656.30 rows=1068530 width=55) (actual time=0.020..601.022 rows=1068530 loops=1)
4.	445.080	4537.336	↑ 1.0	1068530	1	→ Hash (cost=164581.46..164581.46 rows=1068530 width=37) (actual time=4537.336..4537.336 rows=1068530 loops=1) Buckets: 32768 Batches: 4 Memory Usage: 18020kB
5.	2378.031	4092.256	↑ 1.0	1068530	1	→ Hash Join (cost=88841.23..164581.46 rows=1068530 width=37) (actual time=1360.663..4092.256 rows=1068530 loops=1) Hash Cond: (("_F1".id)::text = (hierarchy.id)::text)
6.	353.792	353.792	↑ 1.0	1068530	1	→ Seq Scan on misc "_F1" (cost=0.00..24380.62 rows=1068530 width=37) (actual time=0.014..353.792 rows=1068530 loops=1) Filter: ((lifecyclestate)::text <> 'deleted'::text)
7.	841.667	1360.433	↓ 1.2	2086864	1	→ Hash (cost=54280.88..54280.88 rows=1701388 width=37) (actual time=1360.433..1360.433 rows=2086864 loops=1) Buckets: 32768 Batches: 8 Memory Usage: 17613kB
8.	518.766	518.766	↓ 1.2	2086864	1	→ Seq Scan on hierarchy (cost=0.00..54280.88 rows=1701388 width=37) (actual time=0.007..518.766 rows=2086864 loops=1)

----------------------------------------------------------------------------------------------------------------------------------------------------
 Sort  (cost=496188.38..498859.71 rows=1068530 width=56) (actual time=11771.760..12805.956 rows=1068530 loops=1)
   Sort Key: "_F2".title
   Sort Method: external merge  Disk: 69264kB
   ->  Hash Right Join  (cost=186286.08..357885.09 rows=1068530 width=56) (actual time=4537.462..7673.687 rows=1068530 loops=1)
         Hash Cond: (("_F2".id)::text = (hierarchy.id)::text)
         ->  Seq Scan on dublincore "_F2"  (cost=0.00..127656.30 rows=1068530 width=55) (actual time=0.020..601.022 rows=1068530 loops=1)
         ->  Hash  (cost=164581.46..164581.46 rows=1068530 width=37) (actual time=4537.336..4537.336 rows=1068530 loops=1)
               Buckets: 32768  Batches: 4  Memory Usage: 18020kB
               ->  Hash Join  (cost=88841.23..164581.46 rows=1068530 width=37) (actual time=1360.663..4092.256 rows=1068530 loops=1)
                     Hash Cond: (("_F1".id)::text = (hierarchy.id)::text)
                     ->  Seq Scan on misc "_F1"  (cost=0.00..24380.62 rows=1068530 width=37) (actual time=0.014..353.792 rows=1068530 loops=1)
                           Filter: ((lifecyclestate)::text <> 'deleted'::text)
                     ->  Hash  (cost=54280.88..54280.88 rows=1701388 width=37) (actual time=1360.433..1360.433 rows=2086864 loops=1)
                           Buckets: 32768  Batches: 8  Memory Usage: 17613kB
                           ->  Seq Scan on hierarchy  (cost=0.00..54280.88 rows=1701388 width=37) (actual time=0.007..518.766 rows=2086864 loops=1)
 Total runtime: 12943.476 ms

Per node type stats

node type	count	sum of times	% of query
Hash	2	1286.747 ms	10.0 %
Hash Join	1	2378.031 ms	18.6 %
Hash Right Join	1	2535.329 ms	19.8 %
Seq Scan	3	1473.580 ms	11.5 %
Sort	1	5132.269 ms	40.1 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
dublincore	1	601.022 ms	4.7 %
Seq Scan	1	601.022 ms	100.0 %
hierarchy	1	518.766 ms	4.1 %
Seq Scan	1	518.766 ms	100.0 %
misc	1	353.792 ms	2.8 %
Seq Scan	1	353.792 ms	100.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: IRrI

Colorize:

Columns visibility:

Per node type stats

Per table stats