#	exclusive	inclusive	rows x	rows	loops	node
1.	758.211	2,281.261	↑ 1.0	1	1	→ Aggregate (cost=343,778.33..343,778.34 rows=1 width=0) (actual time=2,281.260..2,281.261 rows=1 loops=1)
2.	1,523.050	1,523.050	↑ 1.0	3,553,485	1	→ Seq Scan on gil_cco (cost=0.00..334,881.46 rows=3,558,746 width=0) (actual time=0.006..1,523.050 rows=3,553,485 loops=1)

"Aggregate  (cost=343778.33..343778.34 rows=1 width=0) (actual time=2281.260..2281.261 rows=1 loops=1)"
"  ->  Seq Scan on gil_cco  (cost=0.00..334881.46 rows=3558746 width=0) (actual time=0.006..1523.050 rows=3553485 loops=1)"
"Planning time: 0.116 ms"
"Execution time: 2281.314 ms"

Per node type stats

node type	count	sum of times	% of query
Aggregate	1	758.211 ms	33.2 %
Seq Scan	1	1,523.050 ms	66.8 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
gil_cco	1	1,523.050 ms	66.8 %
Seq Scan	1	1,523.050 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: HyaNQ : Optimization for: plan #VBwX

Color mode:

Visible columns:

Optimization path:

Per node type stats

Per table stats