#	exclusive	inclusive	rows x	rows	loops	node
1.	125.018	171.299	↑ 250,000.0	2	1	→ Bitmap Heap Scan on orders (cost=9,359.57..951,578.26 rows=500,000 width=16) (actual time=170.701..171.299 rows=2 loops=1) Recheck Cond: (user_account_id = 4500000) Heap Blocks: exact=2
2.	46.281	46.281	↑ 250,000.0	2	1	→ Bitmap Index Scan on orders_user_account_id_idx (cost=0.00..9,234.57 rows=500,000 width=0) (actual time=46.281..46.281 rows=2 loops=1) Index Cond: (user_account_id = 4500000)

Bitmap Heap Scan on orders  (cost=9359.57..951578.26 rows=500000 width=16) (actual time=170.701..171.299 rows=2 loops=1)
  Recheck Cond: (user_account_id = 4500000)
  Heap Blocks: exact=2
  ->  Bitmap Index Scan on orders_user_account_id_idx  (cost=0.00..9234.57 rows=500000 width=0) (actual time=46.281..46.281 rows=2 loops=1)
        Index Cond: (user_account_id = 4500000)
Planning time: 1.162 ms
Execution time: 171.364 ms

Per node type stats

node type	count	sum of times	% of query
Bitmap Heap Scan	1	125.018 ms	73.0 %
Bitmap Index Scan	1	46.281 ms	27.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
orders	1	125.018 ms	73.0 %
Bitmap Heap Scan	1	125.018 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: IwjF : v3

Color mode:

Visible columns:

Optimization path:

Per node type stats

Per table stats