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

#	exclusive	inclusive	rows x	rows	loops	node
1.	0.026	136,663.277	↑ 1.0	10	1	→ Limit (cost=112,346.80..112,346.82 rows=10 width=1,306) (actual time=136,663.244..136,663.277 rows=10 loops=1)
2.	39.059	136,663.251	↑ 971.0	10	1	→ Sort (cost=112,346.80..112,371.07 rows=9,710 width=1,306) (actual time=136,663.239..136,663.251 rows=10 loops=1) Sort Key: c.pulldate, c.pubdate Sort Method: top-N heapsort Memory: 48kB
3.	31.570	136,624.192	↑ 2.3	4,266	1	→ Hash Join (cost=2,266.87..112,136.97 rows=9,710 width=1,306) (actual time=6,537.254..136,624.192 rows=4,266 loops=1) Hash Cond: (c.d_id = t6.id)
4.	175.705	136,363.896	↑ 2.3	4,266	1	→ Nested Loop (cost=1,013.39..110,665.02 rows=9,710 width=1,100) (actual time=6,308.487..136,363.896 rows=4,266 loops=1)
5.	1,673.305	4,269.521	↓ 1.4	32,058	1	→ Hash Join (cost=1,013.39..24,376.61 rows=23,051 width=417) (actual time=260.599..4,269.521 rows=32,058 loops=1) Hash Cond: (a.b_id = b.id)
6.	2,335.691	2,335.691	↓ 1.0	999,110	1	→ Seq Scan on a (cost=0.00..19,481.79 rows=973,581 width=17) (actual time=0.010..2,335.691 rows=999,110 loops=1) Filter: (state < 2)
7.	1.006	260.525	↑ 1.0	148	1	→ Hash (cost=1,011.54..1,011.54 rows=148 width=400) (actual time=260.525..260.525 rows=148 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 64kB
8.	1.334	259.519	↑ 1.0	148	1	→ Nested Loop (cost=5.40..1,011.54 rows=148 width=400) (actual time=1.466..259.519 rows=148 loops=1)
9.	0.523	56.017	↑ 1.0	148	1	→ Nested Loop (cost=5.40..65.45 rows=148 width=194) (actual time=1.392..56.017 rows=148 loops=1)
10.	0.070	0.070	↑ 1.0	1	1	→ Seq Scan on e (cost=0.00..2.73 rows=1 width=156) (actual time=0.036..0.070 rows=1 loops=1) Filter: (id = 2)
11.	54.112	55.424	↑ 1.0	148	1	→ Bitmap Heap Scan on b (cost=5.40..61.25 rows=148 width=38) (actual time=1.336..55.424 rows=148 loops=1) Recheck Cond: (e_id = 2) Filter: count
12.	1.312	1.312	↑ 1.0	148	1	→ Bitmap Index Scan on b_e_id (cost=0.00..5.36 rows=148 width=0) (actual time=1.312..1.312 rows=148 loops=1) Index Cond: (e_id = 2)
13.	202.168	202.168	↑ 1.0	1	148	→ Index Scan using d_id_pkey on d (cost=0.00..6.38 rows=1 width=206) (actual time=1.362..1.366 rows=1 loops=148) Index Cond: (id = b.d_id)
14.	131,918.670	131,918.670	↓ 0.0	0	32,058	→ Index Scan using c_id_pkey on c (cost=0.00..3.73 rows=1 width=683) (actual time=4.114..4.115 rows=0 loops=32,058) Index Cond: (id = a.c_id) Filter: (pulldate >= '2013-07-11 05:00:00+00'::timestamp with time zone)
15.	15.040	228.726	↑ 1.6	5,532	1	→ Hash (cost=1,145.99..1,145.99 rows=8,599 width=206) (actual time=228.726..228.726 rows=5,532 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 1324kB
16.	213.686	213.686	↑ 1.6	5,532	1	→ Seq Scan on d t6 (cost=0.00..1,145.99 rows=8,599 width=206) (actual time=0.015..213.686 rows=5,532 loops=1)

-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Limit  (cost=112346.80..112346.82 rows=10 width=1306) (actual time=136663.244..136663.277 rows=10 loops=1)
   ->  Sort  (cost=112346.80..112371.07 rows=9710 width=1306) (actual time=136663.239..136663.251 rows=10 loops=1)
         Sort Key: c.pulldate, c.pubdate
         Sort Method: top-N heapsort  Memory: 48kB
         ->  Hash Join  (cost=2266.87..112136.97 rows=9710 width=1306) (actual time=6537.254..136624.192 rows=4266 loops=1)
               Hash Cond: (c.d_id = t6.id)
               ->  Nested Loop  (cost=1013.39..110665.02 rows=9710 width=1100) (actual time=6308.487..136363.896 rows=4266 loops=1)
                     ->  Hash Join  (cost=1013.39..24376.61 rows=23051 width=417) (actual time=260.599..4269.521 rows=32058 loops=1)
                           Hash Cond: (a.b_id = b.id)
                           ->  Seq Scan on a  (cost=0.00..19481.79 rows=973581 width=17) (actual time=0.010..2335.691 rows=999110 loops=1)
                                 Filter: (state < 2)
                           ->  Hash  (cost=1011.54..1011.54 rows=148 width=400) (actual time=260.525..260.525 rows=148 loops=1)
                                 Buckets: 1024  Batches: 1  Memory Usage: 64kB
                                 ->  Nested Loop  (cost=5.40..1011.54 rows=148 width=400) (actual time=1.466..259.519 rows=148 loops=1)
                                       ->  Nested Loop  (cost=5.40..65.45 rows=148 width=194) (actual time=1.392..56.017 rows=148 loops=1)
                                             ->  Seq Scan on e  (cost=0.00..2.73 rows=1 width=156) (actual time=0.036..0.070 rows=1 loops=1)
                                                   Filter: (id = 2)
                                             ->  Bitmap Heap Scan on b  (cost=5.40..61.25 rows=148 width=38) (actual time=1.336..55.424 rows=148 loops=1)
                                                   Recheck Cond: (e_id = 2)
                                                   Filter: count
                                                   ->  Bitmap Index Scan on b_e_id  (cost=0.00..5.36 rows=148 width=0) (actual time=1.312..1.312 rows=148 loops=1)
                                                         Index Cond: (e_id = 2)
                                       ->  Index Scan using d_id_pkey on d  (cost=0.00..6.38 rows=1 width=206) (actual time=1.362..1.366 rows=1 loops=148)
                                             Index Cond: (id = b.d_id)
                     ->  Index Scan using c_id_pkey on c  (cost=0.00..3.73 rows=1 width=683) (actual time=4.114..4.115 rows=0 loops=32058)
                           Index Cond: (id = a.c_id)
                           Filter: (pulldate >= '2013-07-11 05:00:00+00'::timestamp with time zone)
               ->  Hash  (cost=1145.99..1145.99 rows=8599 width=206) (actual time=228.726..228.726 rows=5532 loops=1)
                     Buckets: 1024  Batches: 1  Memory Usage: 1324kB
                     ->  Seq Scan on d t6  (cost=0.00..1145.99 rows=8599 width=206) (actual time=0.015..213.686 rows=5532 loops=1)
 Total runtime: 136664.907 ms
(31 rows)

Per node type stats

node type	count	sum of times	% of query
Bitmap Heap Scan	1	54.112 ms	0.0 %
Bitmap Index Scan	1	1.312 ms	0.0 %
Hash	2	16.046 ms	0.0 %
Hash Join	2	1,704.875 ms	1.2 %
Index Scan	2	132,120.838 ms	96.7 %
Limit	1	0.026 ms	0.0 %
Nested Loop	3	177.562 ms	0.1 %
Seq Scan	3	2,549.447 ms	1.9 %
Sort	1	39.059 ms	0.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
a	1	2,335.691 ms	1.7 %
Seq Scan	1	2,335.691 ms	100.0 %
b	1	54.112 ms	0.0 %
Bitmap Heap Scan	1	54.112 ms	100.0 %
c	1	131,918.670 ms	96.5 %
Index Scan	1	131,918.670 ms	100.0 %
d	2	415.854 ms	0.3 %
Index Scan	1	202.168 ms	48.6 %
Seq Scan	1	213.686 ms	51.4 %
e	1	0.070 ms	0.0 %
Seq Scan	1	0.070 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: qBY

Colorize:

Columns visibility:

Per node type stats

Per table stats