Did it help? Consider supporting us - Bitcoin address: 12v2hUztAk2LgzQ9H9LMwuU32urHMjZQnq

#	exclusive	inclusive	rows x	rows	loops	node
1.	0.026	1,517.100	↑ 1.0	10	1	→ Limit (cost=33,444.50..33,444.53 rows=10 width=739) (actual time=1,517.063..1,517.100 rows=10 loops=1)
2.	68.548	1,517.074	↑ 4,454.4	10	1	→ Sort (cost=33,444.50..33,555.86 rows=44,544 width=739) (actual time=1,517.058..1,517.074 rows=10 loops=1) Sort Key: c.pulldate, c.pubdate Sort Method: top-N heapsort Memory: 34kB
3.	77.403	1,448.526	↑ 1.9	23,285	1	→ Hash Join (cost=5,146.63..32,481.92 rows=44,544 width=739) (actual time=613.966..1,448.526 rows=23,285 loops=1) Hash Cond: (c.d_id = t6.id)
4.	345.304	1,369.934	↑ 1.9	23,285	1	→ Hash Join (cost=5,124.33..31,847.15 rows=44,544 width=743) (actual time=612.765..1,369.934 rows=23,285 loops=1) Hash Cond: (c.id = a.c_id)
5.	411.894	411.894	↓ 1.0	165,118	1	→ Seq Scan on c (cost=0.00..22,149.92 rows=165,098 width=703) (actual time=0.004..411.894 rows=165,118 loops=1) Filter: (pulldate >= '1994-04-03 06:00:00+00'::timestamp with time zone)
6.	45.653	612.736	↑ 1.9	23,285	1	→ Hash (cost=4,567.48..4,567.48 rows=44,548 width=44) (actual time=612.736..612.736 rows=23,285 loops=1) Buckets: 8192 Batches: 1 Memory Usage: 1787kB
7.	287.061	567.083	↑ 1.9	23,285	1	→ Hash Join (cost=39.04..4,567.48 rows=44,548 width=44) (actual time=2.370..567.083 rows=23,285 loops=1) Hash Cond: (a.b_id = b.id)
8.	277.669	277.669	↓ 1.0	172,533	1	→ Seq Scan on a (cost=0.00..3,436.59 rows=172,368 width=17) (actual time=0.009..277.669 rows=172,533 loops=1) Filter: (state < 2)
9.	0.213	2.353	↑ 1.0	130	1	→ Hash (cost=37.41..37.41 rows=130 width=31) (actual time=2.353..2.353 rows=130 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 9kB
10.	0.335	2.140	↑ 1.0	130	1	→ Nested Loop (cost=13.91..37.41 rows=130 width=31) (actual time=0.518..2.140 rows=130 loops=1)
11.	0.009	0.009	↑ 1.0	1	1	→ Seq Scan on e (cost=0.00..1.19 rows=1 width=4) (actual time=0.006..0.009 rows=1 loops=1) Filter: (id = 2)
12.	0.766	1.796	↑ 1.0	130	1	→ Hash Join (cost=13.91..34.92 rows=130 width=35) (actual time=0.503..1.796 rows=130 loops=1) Hash Cond: (d.id = b.d_id)
13.	0.557	0.557	↑ 1.0	413	1	→ Seq Scan on d (cost=0.00..17.13 rows=413 width=4) (actual time=0.003..0.557 rows=413 loops=1)
14.	0.216	0.473	↑ 1.0	130	1	→ Hash (cost=12.29..12.29 rows=130 width=39) (actual time=0.473..0.473 rows=130 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 10kB
15.	0.257	0.257	↑ 1.0	130	1	→ Seq Scan on b (cost=0.00..12.29 rows=130 width=39) (actual time=0.006..0.257 rows=130 loops=1) Filter: (count AND (e_id = 2))
16.	0.579	1.189	↑ 1.0	413	1	→ Hash (cost=17.13..17.13 rows=413 width=4) (actual time=1.189..1.189 rows=413 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 15kB
17.	0.610	0.610	↑ 1.0	413	1	→ Seq Scan on d t6 (cost=0.00..17.13 rows=413 width=4) (actual time=0.008..0.610 rows=413 loops=1)

 Limit  (cost=33444.50..33444.53 rows=10 width=739) (actual time=1517.063..1517.100 rows=10 loops=1)
   ->  Sort  (cost=33444.50..33555.86 rows=44544 width=739) (actual time=1517.058..1517.074 rows=10 loops=1)
         Sort Key: c.pulldate, c.pubdate
         Sort Method: top-N heapsort  Memory: 34kB
         ->  Hash Join  (cost=5146.63..32481.92 rows=44544 width=739) (actual time=613.966..1448.526 rows=23285 loops=1)
               Hash Cond: (c.d_id = t6.id)
               ->  Hash Join  (cost=5124.33..31847.15 rows=44544 width=743) (actual time=612.765..1369.934 rows=23285 loops=1)
                     Hash Cond: (c.id = a.c_id)
                     ->  Seq Scan on c  (cost=0.00..22149.92 rows=165098 width=703) (actual time=0.004..411.894 rows=165118 loops=1)
                           Filter: (pulldate >= '1994-04-03 06:00:00+00'::timestamp with time zone)
                     ->  Hash  (cost=4567.48..4567.48 rows=44548 width=44) (actual time=612.736..612.736 rows=23285 loops=1)
                           Buckets: 8192  Batches: 1  Memory Usage: 1787kB
                           ->  Hash Join  (cost=39.04..4567.48 rows=44548 width=44) (actual time=2.370..567.083 rows=23285 loops=1)
                                 Hash Cond: (a.b_id = b.id)
                                 ->  Seq Scan on a  (cost=0.00..3436.59 rows=172368 width=17) (actual time=0.009..277.669 rows=172533 loops=1)
                                       Filter: (state < 2)
                                 ->  Hash  (cost=37.41..37.41 rows=130 width=31) (actual time=2.353..2.353 rows=130 loops=1)
                                       Buckets: 1024  Batches: 1  Memory Usage: 9kB
                                       ->  Nested Loop  (cost=13.91..37.41 rows=130 width=31) (actual time=0.518..2.140 rows=130 loops=1)
                                             ->  Seq Scan on e  (cost=0.00..1.19 rows=1 width=4) (actual time=0.006..0.009 rows=1 loops=1)
                                                   Filter: (id = 2)
                                             ->  Hash Join  (cost=13.91..34.92 rows=130 width=35) (actual time=0.503..1.796 rows=130 loops=1)
                                                   Hash Cond: (d.id = b.d_id)
                                                   ->  Seq Scan on d  (cost=0.00..17.13 rows=413 width=4) (actual time=0.003..0.557 rows=413 loops=1)
                                                   ->  Hash  (cost=12.29..12.29 rows=130 width=39) (actual time=0.473..0.473 rows=130 loops=1)
                                                         Buckets: 1024  Batches: 1  Memory Usage: 10kB
                                                         ->  Seq Scan on b  (cost=0.00..12.29 rows=130 width=39) (actual time=0.006..0.257 rows=130 loops=1)
                                                               Filter: (count AND (e_id = 2))
               ->  Hash  (cost=17.13..17.13 rows=413 width=4) (actual time=1.189..1.189 rows=413 loops=1)
                     Buckets: 1024  Batches: 1  Memory Usage: 15kB
                     ->  Seq Scan on d t6  (cost=0.00..17.13 rows=413 width=4) (actual time=0.008..0.610 rows=413 loops=1)
 Total runtime: 1517.247 ms
(32 rows)

Per node type stats

node type	count	sum of times	% of query
Hash	4	46.661 ms	3.1 %
Hash Join	4	710.534 ms	46.8 %
Limit	1	0.026 ms	0.0 %
Nested Loop	1	0.335 ms	0.0 %
Seq Scan	6	690.996 ms	45.5 %
Sort	1	68.548 ms	4.5 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
a	1	277.669 ms	18.3 %
Seq Scan	1	277.669 ms	100.0 %
b	1	0.257 ms	0.0 %
Seq Scan	1	0.257 ms	100.0 %
c	1	411.894 ms	27.2 %
Seq Scan	1	411.894 ms	100.0 %
d	2	1.167 ms	0.1 %
Seq Scan	2	1.167 ms	100.0 %
e	1	0.009 ms	0.0 %
Seq Scan	1	0.009 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: L7OS

Colorize:

Columns visibility:

Per node type stats

Per table stats