#	exclusive	inclusive	rows x	rows	loops	node
1.	0.004	104022.471	↑ 1.0	1	1	→ Limit (cost=0.00..16.22 rows=1 width=46) (actual time=104022.471..104022.471 rows=1 loops=1)
2.	104022.467	104022.467	↑ 30540.0	1	1	→ Index Scan using "tableTimestamp" on table (cost=0.00..495345.38 rows=30540 width=46) (actual time=104022.467..104022.467 rows=1 loops=1) Filter: ((id > 10106972) AND (devid = 5) AND (serid = '7810096790609417766'::bpchar))

"Limit  (cost=0.00..16.22 rows=1 width=46) (actual time=104022.471..104022.471 rows=1 loops=1)"
"  ->  Index Scan using "tableTimestamp" on table  (cost=0.00..495345.38 rows=30540 width=46) (actual time=104022.467..104022.467 rows=1 loops=1)"
"        Filter: ((id > 10106972) AND (devid = 5) AND (serid = '7810096790609417766'::bpchar))"
"Total runtime: 104022.509 ms"

Per node type stats

node type	count	sum of times	% of query
Index Scan	1	104022.467 ms	100.0 %
Limit	1	0.004 ms	0.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
table	1	104022.467 ms	100.0 %
Index Scan	1	104022.467 ms	100.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: 1f7 : slow query when sorting on double precision field

Colorize:

Columns visibility:

Per node type stats

Per table stats