explain.depesz.com

PostgreSQL's explain analyze made readable

Result: ULZg : Optimization for: plan #Qeco

Settings

Optimization path:

# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0

Gather (cost=1,023.60..1,998,728,629.89 rows=149,358,468 width=92) (actual rows= loops=)

  • Workers Planned: 2
2. 0.000 0.000 ↓ 0.0

Nested Loop Left Join (cost=23.59..1,983,791,783.09 rows=62,232,695 width=92) (actual rows= loops=)

  • Join Filter: ((de.judge = judge.judge) OR (de.location = judge.judge))
3. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=23.59..2,672,386.85 rows=32,840,613 width=75) (actual rows= loops=)

  • Hash Cond: (de.location = call.call)
  • Join Filter: (de.location <> ALL ('{"APPEAL COURT","METRA POLICE","WARRANT DESIGNATION CALL","EXPUNGEMENT/SEALING RECRD CALL","ENVIRONMENTAL CONTROL","PRESIDING JUDGE"}'::text[]))
4. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on raw_docket_events de (cost=0.00..1,808,959.13 rows=32,840,613 width=71) (actual rows= loops=)

5. 0.000 0.000 ↓ 0.0

Hash (cost=13.82..13.82 rows=782 width=22) (actual rows= loops=)

6. 0.000 0.000 ↓ 0.0

Seq Scan on call (cost=0.00..13.82 rows=782 width=22) (actual rows= loops=)

7. 0.000 0.000 ↓ 0.0

Seq Scan on judge (cost=0.00..31.86 rows=1,886 width=22) (actual rows= loops=)