#	exclusive	inclusive	rows x	rows	loops	node
1.	0.014	1780.599	↑ 1.0	100	1	→ Limit (cost=0.00..1575.48 rows=100 width=46) (actual time=1780.213..1780.599 rows=100 loops=1)
2.	1780.585	1780.585	↑ 306.9	100	1	→ Index Scan using "tableSortTimeStamp" on table (cost=0.00..483483.83 rows=30688 width=46) (actual time=1780.210..1780.585 rows=100 loops=1) Index Cond: ((devid = 16) AND (serid = '7810096790609417766'::bpchar)) Filter: (id > 10101772)

"Limit  (cost=0.00..1575.48 rows=100 width=46) (actual time=1780.213..1780.599 rows=100 loops=1)"
"  ->  Index Scan using "tableSortTimeStamp" on table  (cost=0.00..483483.83 rows=30688 width=46) (actual time=1780.210..1780.585 rows=100 loops=1)"
"        Index Cond: ((devid = 16) AND (serid = '7810096790609417766'::bpchar))"
"        Filter: (id > 10101772)"
"Total runtime: 1780.641 ms"

Per node type stats

node type	count	sum of times	% of query
Index Scan	1	1780.585 ms	100.0 %
Limit	1	0.014 ms	0.0 %

Per table stats

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

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: GIqM

Colorize:

Columns visibility:

Per node type stats

Per table stats