#	exclusive	inclusive	rows x	rows	loops	node
1.	0.003	0.464	↑ 1.0	10	1	→ Limit (cost=0.00..0.21 rows=10 width=649) (actual time=0.462..0.464 rows=10 loops=1) Planning time: 7.957 ms Execution time: 0.521 ms
2.	0.461	0.461	↑ 111,586,070.9	10	1	→ Seq Scan on b_sf_sent_t (cost=0.00..23,744,656.13 rows=1,115,860,709 width=649) (actual time=0.461..0.461 rows=10 loops=1)

Limit  (cost=0.00..0.21 rows=10 width=649) (actual time=0.462..0.464 rows=10 loops=1)
   ->  Seq Scan on b_sf_sent_t  (cost=0.00..23744656.13 rows=1115860709 width=649) (actual time=0.461..0.461 rows=10 loops=1)
 Planning time: 7.957 ms
 Execution time: 0.521 ms

Per node type stats

node type	count	sum of times	% of query
Limit	1	0.003 ms	0.6 %
Seq Scan	1	0.461 ms	99.4 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
b_sf_sent_t	1	0.461 ms	99.4 %
Seq Scan	1	0.461 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Q5xF

Color mode:

Visible columns:

Per node type stats

Per table stats