#	rows x	node
1.	↓ 0.0	→ Sort (cost=49,189.14..49,194.76 rows=2,250 width=20) (actual rows= loops=) Sort Key: h.clock
2.	↓ 0.0	→ Append (cost=24.59..49,063.86 rows=2,250 width=20) (actual rows= loops=)
3.	↓ 0.0	→ Bitmap Heap Scan on history_p2019_01_30 h (cost=24.59..49,063.86 rows=2,250 width=20) (actual rows= loops=) Recheck Cond: ((itemid = ANY ('{46077,46094,46111}'::bigint[])) AND (clock >= 1548831244) AND (clock <= 1548867244))
4.	↓ 0.0	→ Bitmap Index Scan on history_p2019_01_30_itemid_clock_idx_brin (cost=0.00..24.03 rows=19,972 width=0) (actual rows= loops=) Index Cond: ((itemid = ANY ('{46077,46094,46111}'::bigint[])) AND (clock >= 1548831244) AND (clock <= 1548867244))

 Sort (cost=49189.14..49194.76 rows=2250 width=20)
   Sort Key: h.clock
   -> Append (cost=24.59..49063.86 rows=2250 width=20)
        -> Bitmap Heap Scan on history_p2019_01_30 h (cost=24.59..49063.86 rows=2250 width=20)
             Recheck Cond: ((itemid = ANY ('{46077,46094,46111}'::bigint[])) AND (clock >= 1548831244) AND (clock <= 1548867244))
             -> Bitmap Index Scan on history_p2019_01_30_itemid_clock_idx_brin (cost=0.00..24.03 rows=19972 width=0)
                  Index Cond: ((itemid = ANY ('{46077,46094,46111}'::bigint[])) AND (clock >= 1548831244) AND (clock <= 1548867244))

Per node type stats

node type	count	sum of times	% of query
Append	1	0.000 ms	0.0 %
Bitmap Heap Scan	1	0.000 ms	0.0 %
Bitmap Index 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
history_p2019_01_30	1	0.000 ms	0.0 %
Bitmap Heap Scan	1	0.000 ms	0.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: jzr : Optimization for: plan #cwEm

Color mode:

Visible columns:

Optimization path:

Per node type stats

Per table stats