#	exclusive	inclusive	rows x	rows	loops	node
1.	0.000	0.000	↓ 0.0			→ Sort (cost=24960.27..25089.52 rows=51697 width=408) (actual time=.. rows= loops=) Sort Key: id, name_template, default_code
2.	0.000	0.000	↓ 0.0			→ Seq Scan on product_product (cost=0.00..1823.97 rows=51697 width=408) (actual time=.. rows= loops=)

"Sort  (cost=24960.27..25089.52 rows=51697 width=408)"
"  Sort Key: id, name_template, default_code"
"  ->  Seq Scan on product_product  (cost=0.00..1823.97 rows=51697 width=408)"

Per node type stats

node type	count	sum of times	% of query
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
product_product	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: t6K

Colorize:

Columns visibility:

Per node type stats

Per table stats