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

#	exclusive	inclusive	rows x	rows	loops	node
1.	0.036	2,248.893	↑ 1.0	10	1	→ Limit (cost=54,749.16..54,749.18 rows=10 width=1,328) (actual time=2,248.845..2,248.893 rows=10 loops=1)
2.	129.879	2,248.857	↑ 3,559.9	10	1	→ Sort (cost=54,749.16..54,838.16 rows=35,599 width=1,328) (actual time=2,248.841..2,248.857 rows=10 loops=1) Sort Key: c.pulldate, c.pubdate Sort Method: top-N heapsort Memory: 45kB
3.	88.112	2,118.978	↑ 1.5	23,159	1	→ Hash Join (cost=8,248.49..53,979.88 rows=35,599 width=1,328) (actual time=676.413..2,118.978 rows=23,159 loops=1) Hash Cond: (c.d_id = t6.id)
4.	90.388	2,029.260	↑ 1.5	23,159	1	→ Hash Join (cost=8,226.20..53,468.10 rows=35,599 width=1,150) (actual time=674.759..2,029.260 rows=23,159 loops=1) Hash Cond: (b.d_id = d.id)
5.	72.203	1,937.464	↑ 1.5	23,159	1	→ Nested Loop (cost=8,203.90..52,956.32 rows=35,599 width=972) (actual time=673.321..1,937.464 rows=23,159 loops=1)
6.	0.021	0.021	↑ 1.0	1	1	→ Seq Scan on e (cost=0.00..1.19 rows=1 width=157) (actual time=0.013..0.021 rows=1 loops=1) Filter: (id = 2)
7.	346.262	1,865.240	↑ 1.5	23,159	1	→ Merge Join (cost=8,203.90..52,599.14 rows=35,599 width=815) (actual time=673.300..1,865.240 rows=23,159 loops=1) Merge Cond: (c.id = a.c_id)
8.	719.134	719.134	↑ 1.0	163,678	1	→ Index Scan using c_id_pkey on c (cost=0.00..43,412.63 rows=163,753 width=759) (actual time=0.014..719.134 rows=163,678 loops=1) Filter: (pulldate >= '1994-04-03 06:00:00+00'::timestamp with time zone)
9.	81.440	799.844	↑ 1.5	23,159	1	→ Materialize (cost=8,201.76..8,379.77 rows=35,602 width=56) (actual time=673.270..799.844 rows=23,159 loops=1)
10.	123.478	718.404	↑ 1.5	23,159	1	→ Sort (cost=8,201.76..8,290.77 rows=35,602 width=56) (actual time=673.264..718.404 rows=23,159 loops=1) Sort Key: a.c_id Sort Method: external merge Disk: 1584kB
11.	294.893	594.926	↑ 1.5	23,159	1	→ Hash Join (cost=13.91..4,292.31 rows=35,602 width=56) (actual time=0.751..594.926 rows=23,159 loops=1) Hash Cond: (a.b_id = b.id)
12.	299.521	299.521	↓ 1.2	171,136	1	→ Seq Scan on a (cost=0.00..3,405.80 rows=137,754 width=17) (actual time=0.077..299.521 rows=171,136 loops=1) Filter: (state = ANY ('{0,1}'::integer[]))
13.	0.211	0.512	↑ 1.0	130	1	→ Hash (cost=12.29..12.29 rows=130 width=39) (actual time=0.512..0.512 rows=130 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 10kB
14.	0.301	0.301	↑ 1.0	130	1	→ Seq Scan on b (cost=0.00..12.29 rows=130 width=39) (actual time=0.012..0.301 rows=130 loops=1) Filter: (count AND (e_id = 2))
15.	0.797	1.408	↑ 1.0	413	1	→ Hash (cost=17.13..17.13 rows=413 width=178) (actual time=1.408..1.408 rows=413 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 87kB
16.	0.611	0.611	↑ 1.0	413	1	→ Seq Scan on d (cost=0.00..17.13 rows=413 width=178) (actual time=0.003..0.611 rows=413 loops=1)
17.	0.820	1.606	↑ 1.0	413	1	→ Hash (cost=17.13..17.13 rows=413 width=178) (actual time=1.606..1.606 rows=413 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 87kB
18.	0.786	0.786	↑ 1.0	413	1	→ Seq Scan on d t6 (cost=0.00..17.13 rows=413 width=178) (actual time=0.033..0.786 rows=413 loops=1)

 Limit  (cost=54749.16..54749.18 rows=10 width=1328) (actual time=2248.845..2248.893 rows=10 loops=1)
   ->  Sort  (cost=54749.16..54838.16 rows=35599 width=1328) (actual time=2248.841..2248.857 rows=10 loops=1)
         Sort Key: c.pulldate, c.pubdate
         Sort Method: top-N heapsort  Memory: 45kB
         ->  Hash Join  (cost=8248.49..53979.88 rows=35599 width=1328) (actual time=676.413..2118.978 rows=23159 loops=1)
               Hash Cond: (c.d_id = t6.id)
               ->  Hash Join  (cost=8226.20..53468.10 rows=35599 width=1150) (actual time=674.759..2029.260 rows=23159 loops=1)
                     Hash Cond: (b.d_id = d.id)
                     ->  Nested Loop  (cost=8203.90..52956.32 rows=35599 width=972) (actual time=673.321..1937.464 rows=23159 loops=1)
                           ->  Seq Scan on e  (cost=0.00..1.19 rows=1 width=157) (actual time=0.013..0.021 rows=1 loops=1)
                                 Filter: (id = 2)
                           ->  Merge Join  (cost=8203.90..52599.14 rows=35599 width=815) (actual time=673.300..1865.240 rows=23159 loops=1)
                                 Merge Cond: (c.id = a.c_id)
                                 ->  Index Scan using c_id_pkey on c  (cost=0.00..43412.63 rows=163753 width=759) (actual time=0.014..719.134 rows=163678 loops=1)
                                       Filter: (pulldate >= '1994-04-03 06:00:00+00'::timestamp with time zone)
                                 ->  Materialize  (cost=8201.76..8379.77 rows=35602 width=56) (actual time=673.270..799.844 rows=23159 loops=1)
                                       ->  Sort  (cost=8201.76..8290.77 rows=35602 width=56) (actual time=673.264..718.404 rows=23159 loops=1)
                                             Sort Key: a.c_id
                                             Sort Method: external merge  Disk: 1584kB
                                             ->  Hash Join  (cost=13.91..4292.31 rows=35602 width=56) (actual time=0.751..594.926 rows=23159 loops=1)
                                                   Hash Cond: (a.b_id = b.id)
                                                   ->  Seq Scan on a  (cost=0.00..3405.80 rows=137754 width=17) (actual time=0.077..299.521 rows=171136 loops=1)
                                                         Filter: (state = ANY ('{0,1}'::integer[]))
                                                   ->  Hash  (cost=12.29..12.29 rows=130 width=39) (actual time=0.512..0.512 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.012..0.301 rows=130 loops=1)
                                                               Filter: (count AND (e_id = 2))
                     ->  Hash  (cost=17.13..17.13 rows=413 width=178) (actual time=1.408..1.408 rows=413 loops=1)
                           Buckets: 1024  Batches: 1  Memory Usage: 87kB
                           ->  Seq Scan on d  (cost=0.00..17.13 rows=413 width=178) (actual time=0.003..0.611 rows=413 loops=1)
               ->  Hash  (cost=17.13..17.13 rows=413 width=178) (actual time=1.606..1.606 rows=413 loops=1)
                     Buckets: 1024  Batches: 1  Memory Usage: 87kB
                     ->  Seq Scan on d t6  (cost=0.00..17.13 rows=413 width=178) (actual time=0.033..0.786 rows=413 loops=1)
 Total runtime: 2251.192 ms
(34 rows)

Per node type stats

node type	count	sum of times	% of query
Hash	3	1.828 ms	0.1 %
Hash Join	3	473.393 ms	21.1 %
Index Scan	1	719.134 ms	32.0 %
Limit	1	0.036 ms	0.0 %
Materialize	1	81.440 ms	3.6 %
Merge Join	1	346.262 ms	15.4 %
Nested Loop	1	72.203 ms	3.2 %
Seq Scan	5	301.240 ms	13.4 %
Sort	2	253.357 ms	11.3 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
a	1	299.521 ms	13.3 %
Seq Scan	1	299.521 ms	100.0 %
b	1	0.301 ms	0.0 %
Seq Scan	1	0.301 ms	100.0 %
c	1	719.134 ms	32.0 %
Index Scan	1	719.134 ms	100.0 %
d	2	1.397 ms	0.1 %
Seq Scan	2	1.397 ms	100.0 %
e	1	0.021 ms	0.0 %
Seq Scan	1	0.021 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: WWX

Colorize:

Columns visibility:

Per node type stats

Per table stats