explain.depesz.com

PostgreSQL's explain analyze made readable

Result: lc66

Settings
# exclusive inclusive rows x rows loops node
1. 0.008 0.068 ↑ 7.5 6 1

Hash Join (cost=207.30..378.90 rows=45 width=68) (actual time=0.057..0.068 rows=6 loops=1)

  • Hash Cond: (o.id = oc.order_id)
2. 0.015 0.021 ↑ 64.2 6 1

Bitmap Heap Scan on t_order o (cost=8.26..175.00 rows=385 width=40) (actual time=0.013..0.021 rows=6 loops=1)

  • Recheck Cond: ((retired_date IS NULL) AND (actionable_date IS NOT NULL) AND ((status)::text <> ALL ('{CLOSED,SENT,SAVED,AM_REVIEW,EDI_PENDING,NEEDS_ATTENTION}'::text[])))
  • Heap Blocks: exact=6
3. 0.006 0.006 ↑ 64.2 6 1

Bitmap Index Scan on idx_priority_report_1 (cost=0.00..8.16 rows=385 width=0) (actual time=0.006..0.006 rows=6 loops=1)

4. 0.004 0.039 ↑ 64.2 6 1

Hash (cost=194.23..194.23 rows=385 width=8) (actual time=0.039..0.039 rows=6 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
5. 0.003 0.035 ↑ 64.2 6 1

Subquery Scan on oc (cost=186.53..194.23 rows=385 width=8) (actual time=0.029..0.035 rows=6 loops=1)

6. 0.011 0.032 ↑ 64.2 6 1

HashAggregate (cost=186.53..190.38 rows=385 width=16) (actual time=0.028..0.032 rows=6 loops=1)

  • Group Key: o_1.id
  • Filter: (sum(CASE WHEN (oc_1.id IS NULL) THEN 0 ELSE 1 END) < 1)
7. 0.008 0.021 ↑ 64.2 6 1

Hash Left Join (cost=16.41..184.60 rows=385 width=16) (actual time=0.012..0.021 rows=6 loops=1)

  • Hash Cond: (o_1.id = oc_1.order_id)
8. 0.008 0.011 ↑ 64.2 6 1

Bitmap Heap Scan on t_order o_1 (cost=8.26..175.00 rows=385 width=8) (actual time=0.005..0.011 rows=6 loops=1)

  • Recheck Cond: ((retired_date IS NULL) AND (actionable_date IS NOT NULL) AND ((status)::text <> ALL ('{CLOSED,SENT,SAVED,AM_REVIEW,EDI_PENDING,NEEDS_ATTENTION}'::text[])))
  • Heap Blocks: exact=6
9. 0.003 0.003 ↑ 64.2 6 1

Bitmap Index Scan on idx_priority_report_1 (cost=0.00..8.16 rows=385 width=0) (actual time=0.003..0.003 rows=6 loops=1)

10. 0.000 0.002 ↓ 0.0 0 1

Hash (cost=8.14..8.14 rows=1 width=16) (actual time=0.002..0.002 rows=0 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
11. 0.002 0.002 ↓ 0.0 0 1

Index Scan using idx_priority_report_2 on t_orderconcern oc_1 (cost=0.12..8.14 rows=1 width=16) (actual time=0.002..0.002 rows=0 loops=1)