#	exclusive	inclusive	rows x	rows	loops	node
1.	0.015	30.934	↑ 1.0	10	1	→ Sort (cost=13671.47..13671.49 rows=10 width=1140) (actual time=30.934..30.934 rows=10 loops=1) Sort Key: x."timestamp", x.id Sort Method: quicksort Memory: 18kB
2.	0.001	30.919	↑ 1.0	10	1	→ Limit (cost=13671.18..13671.20 rows=10 width=1140) (actual time=30.918..30.919 rows=10 loops=1)
3.	0.045	30.918	↑ 3.7	10	1	→ Sort (cost=13671.18..13671.27 rows=37 width=1140) (actual time=30.917..30.918 rows=10 loops=1) Sort Key: x."timestamp", x.id Sort Method: top-N heapsort Memory: 18kB
4.	0.029	30.873	↓ 3.0	110	1	→ Subquery Scan x (cost=13668.73..13670.38 rows=37 width=1140) (actual time=30.828..30.873 rows=110 loops=1) Filter: (x.id > 1)
5.	0.016	30.844	↑ 1.0	110	1	→ Limit (cost=13668.73..13669.00 rows=110 width=68) (actual time=30.822..30.844 rows=110 loops=1)
6.	12.822	30.828	↑ 291.2	110	1	→ Sort (cost=13668.73..13748.82 rows=32036 width=68) (actual time=30.819..30.828 rows=110 loops=1) Sort Key: divaevent.id Sort Method: top-N heapsort Memory: 31kB
7.	14.601	18.006	↓ 1.0	32258	1	→ Bitmap Heap Scan on divaevent (cost=2236.58..12422.31 rows=32036 width=68) (actual time=3.649..18.006 rows=32258 loops=1) Recheck Cond: (deviceid = 1) Filter: ((id > 1) AND (serverid = '7015498111931795223'::bpchar))
8.	3.405	3.405	↑ 1.0	32355	1	→ Bitmap Index Scan on "DivaEventDeviceId" (cost=0.00..2228.57 rows=32556 width=0) (actual time=3.405..3.405 rows=32355 loops=1) Index Cond: (deviceid = 1)

"Sort  (cost=13671.47..13671.49 rows=10 width=1140) (actual time=30.934..30.934 rows=10 loops=1)"
"  Sort Key: x."timestamp", x.id"
"  Sort Method:  quicksort  Memory: 18kB"
"  ->  Limit  (cost=13671.18..13671.20 rows=10 width=1140) (actual time=30.918..30.919 rows=10 loops=1)"
"        ->  Sort  (cost=13671.18..13671.27 rows=37 width=1140) (actual time=30.917..30.918 rows=10 loops=1)"
"              Sort Key: x."timestamp", x.id"
"              Sort Method:  top-N heapsort  Memory: 18kB"
"              ->  Subquery Scan x  (cost=13668.73..13670.38 rows=37 width=1140) (actual time=30.828..30.873 rows=110 loops=1)"
"                    Filter: (x.id > 1)"
"                    ->  Limit  (cost=13668.73..13669.00 rows=110 width=68) (actual time=30.822..30.844 rows=110 loops=1)"
"                          ->  Sort  (cost=13668.73..13748.82 rows=32036 width=68) (actual time=30.819..30.828 rows=110 loops=1)"
"                                Sort Key: divaevent.id"
"                                Sort Method:  top-N heapsort  Memory: 31kB"
"                                ->  Bitmap Heap Scan on divaevent  (cost=2236.58..12422.31 rows=32036 width=68) (actual time=3.649..18.006 rows=32258 loops=1)"
"                                      Recheck Cond: (deviceid = 1)"
"                                      Filter: ((id > 1) AND (serverid = '7015498111931795223'::bpchar))"
"                                      ->  Bitmap Index Scan on "DivaEventDeviceId"  (cost=0.00..2228.57 rows=32556 width=0) (actual time=3.405..3.405 rows=32355 loops=1)"
"                                            Index Cond: (deviceid = 1)"
"Total runtime: 31.071 ms"

Per node type stats

node type	count	sum of times	% of query
Bitmap Heap Scan	1	14.601 ms	47.2 %
Bitmap Index Scan	1	3.405 ms	11.0 %
Limit	2	0.017 ms	0.1 %
Sort	3	12.882 ms	41.6 %
Subquery Scan x	1	0.029 ms	0.1 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
divaevent	1	14.601 ms	47.2 %
Bitmap Heap Scan	1	14.601 ms	100.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: QRWM

Colorize:

Columns visibility:

Per node type stats

Per table stats