#	rows x	node
1.	↓ 0.0	→ Limit (cost=1665.72..1665.97 rows=100 width=8) (actual time=.. rows= loops=) Output: overdraftlimit
2.	↓ 0.0	→ Sort (cost=1665.72..1689.77 rows=9617 width=8) (actual time=.. rows= loops=) Output: overdraftlimit Sort Key: ddadata_entity.overdraftlimit
3.	↓ 0.0	→ Seq Scan on public.ddadata_entity (cost=0.00..1298.17 rows=9617 width=8) (actual time=.. rows= loops=) Output: overdraftlimit

"Limit  (cost=1665.72..1665.97 rows=100 width=8)"
"  Output: overdraftlimit"
"  ->  Sort  (cost=1665.72..1689.77 rows=9617 width=8)"
"        Output: overdraftlimit"
"        Sort Key: ddadata_entity.overdraftlimit"
"        ->  Seq Scan on public.ddadata_entity  (cost=0.00..1298.17 rows=9617 width=8)"
"              Output: overdraftlimit"

Per node type stats

node type	count	sum of times	% of query
Limit	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
Sort	1	0.000 ms	0.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
public.ddadata_entity	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: 2W9

Colorize:

Columns visibility:

Per node type stats

Per table stats