#	exclusive	inclusive	rows x	rows	loops	node
1.	0.045	34.039	↑ 1.0	10	1	→ Sort (cost=13672.77..13672.79 rows=10 width=1140) (actual time=34.038..34.039 rows=10 loops=1) Sort Key: divaevent."timestamp", divaevent.id Sort Method: quicksort Memory: 18kB
2.	0.003	33.994	↑ 1.0	10	1	→ Limit (cost=13672.48..13672.50 rows=10 width=1140) (actual time=33.992..33.994 rows=10 loops=1)
3.	0.049	33.991	↑ 11.0	10	1	→ Sort (cost=13672.48..13672.75 rows=110 width=1140) (actual time=33.991..33.991 rows=10 loops=1) Sort Key: divaevent."timestamp", divaevent.id Sort Method: top-N heapsort Memory: 18kB
4.	0.014	33.942	↑ 1.0	110	1	→ Limit (cost=13668.73..13669.00 rows=110 width=68) (actual time=33.923..33.942 rows=110 loops=1)
5.	13.474	33.928	↑ 291.2	110	1	→ Sort (cost=13668.73..13748.82 rows=32036 width=68) (actual time=33.919..33.928 rows=110 loops=1) Sort Key: divaevent.id Sort Method: top-N heapsort Memory: 31kB
6.	16.497	20.454	↓ 1.0	32282	1	→ Bitmap Heap Scan on divaevent (cost=2236.58..12422.31 rows=32036 width=68) (actual time=4.242..20.454 rows=32282 loops=1) Recheck Cond: (deviceid = 1) Filter: ((id > 1) AND (serverid = '7015498111931795223'::bpchar))
7.	3.957	3.957	↑ 1.0	32379	1	→ Bitmap Index Scan on "DivaEventDeviceId" (cost=0.00..2228.57 rows=32556 width=0) (actual time=3.957..3.957 rows=32379 loops=1) Index Cond: (deviceid = 1)

"Sort  (cost=13672.77..13672.79 rows=10 width=1140) (actual time=34.038..34.039 rows=10 loops=1)"
"  Sort Key: divaevent."timestamp", divaevent.id"
"  Sort Method:  quicksort  Memory: 18kB"
"  ->  Limit  (cost=13672.48..13672.50 rows=10 width=1140) (actual time=33.992..33.994 rows=10 loops=1)"
"        ->  Sort  (cost=13672.48..13672.75 rows=110 width=1140) (actual time=33.991..33.991 rows=10 loops=1)"
"              Sort Key: divaevent."timestamp", divaevent.id"
"              Sort Method:  top-N heapsort  Memory: 18kB"
"              ->  Limit  (cost=13668.73..13669.00 rows=110 width=68) (actual time=33.923..33.942 rows=110 loops=1)"
"                    ->  Sort  (cost=13668.73..13748.82 rows=32036 width=68) (actual time=33.919..33.928 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=4.242..20.454 rows=32282 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.957..3.957 rows=32379 loops=1)"
"                                      Index Cond: (deviceid = 1)"
"Total runtime: 34.166 ms"

Per node type stats

node type	count	sum of times	% of query
Bitmap Heap Scan	1	16.497 ms	48.5 %
Bitmap Index Scan	1	3.957 ms	11.6 %
Limit	2	0.017 ms	0.0 %
Sort	3	13.568 ms	39.9 %

Per table stats

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

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: tqwU

Colorize:

Columns visibility:

Per node type stats

Per table stats