explain.depesz.com

A tool for finding a real cause for slow queries.

Result: q5f

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

Nested Loop Semi Join (cost=43627.64..95241.63 rows=1 width=4) (actual time=.. rows= loops=)

  • Join Filter: (fnl.fnl_key = public.prc.prc_fnl_key)
2. 0.000 0.000 ↓ 0.0
→

Nested Loop Semi Join (cost=24385.26..40575.12 rows=1 width=16) (actual time=.. rows= loops=)

  • Join Filter: (fnl.fnl_key = public.prc.prc_fnl_key)
3. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=5291.63..5317.02 rows=1 width=12) (actual time=.. rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Subquery Scan on p (cost=5291.63..5308.69 rows=1 width=8) (actual time=.. rows= loops=)

  • Filter: ((p.prc_com_petitioner_key = 500000036) AND (lower((p.prc_process)::text) ~~ 'niv%'::text))
5. 0.000 0.000 ↓ 0.0
→

Unique (cost=5291.63..5299.73 rows=512 width=29) (actual time=.. rows= loops=)

6. 0.000 0.000 ↓ 0.0
→

Sort (cost=5291.63..5295.68 rows=1619 width=29) (actual time=.. rows= loops=)

  • Sort Key: public.prc.prc_fnl_key, public.prc.prc_current_process, public.prc.prc_date_opened
7. 0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on prc (cost=44.90..5205.33 rows=1619 width=29) (actual time=.. rows= loops=)

  • Filter: (lower((prc_process)::text) ~~ 'niv%'::text)
8. 0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on idxl_prc_process (cost=0.00..44.49 rows=1619 width=0) (actual time=.. rows= loops=)

  • Index Cond: ((lower((prc_process)::text) >= 'niv'::text) AND (lower((prc_process)::text) < 'niw'::text))
9. 0.000 0.000 ↓ 0.0
→

Index Scan using fnl_pkey on fnl (cost=0.00..8.32 rows=1 width=4) (actual time=.. rows= loops=)

  • Index Cond: (fnl.fnl_key = p.prc_fnl_key)
  • Filter: ((fnl.fnl_fk_table = 35) AND (fnl.fnl_fk_key = 50002) AND (fnl.fnl_delete_me = '0100-01-01'::date) AND (lower((fnl.fnl_case_id)::text) <> ''::text))
10. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=19093.63..33691.10 rows=161916 width=4) (actual time=.. rows= loops=)

11. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=19093.63..19120.25 rows=2662 width=4) (actual time=.. rows= loops=)

12. 0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on evt (cost=1358.42..19044.66 rows=19585 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (evt_act_key = 500000222)
  • Filter: (evt_activity_date <= '2005-12-31'::date)
13. 0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on idx_evt_act_key (cost=0.00..1353.53 rows=73216 width=0) (actual time=.. rows= loops=)

  • Index Cond: (evt_act_key = 500000222)
14. 0.000 0.000 ↓ 0.0
→

Index Scan using prc_pkey on prc (cost=0.00..5.45 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (public.prc.prc_key = public.evt.evt_prc_key)
15. 0.000 0.000 ↓ 0.0
→

Hash Join (cost=19242.38..53099.51 rows=161916 width=4) (actual time=.. rows= loops=)

  • Hash Cond: (public.prc.prc_key = public.evt.evt_prc_key)
16. 0.000 0.000 ↓ 0.0
→

Seq Scan on prc (cost=0.00..29723.31 rows=323831 width=8) (actual time=.. rows= loops=)

17. 0.000 0.000 ↓ 0.0
→

Hash (cost=19134.97..19134.97 rows=8593 width=4) (actual time=.. rows= loops=)

18. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=18963.11..19049.04 rows=8593 width=4) (actual time=.. rows= loops=)

19. 0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on evt (cost=1232.49..18805.05 rows=63224 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (evt_act_key = 500000221)
  • Filter: (evt_activity_date >= '1999-01-01'::date)
20. 0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on idx_evt_act_key (cost=0.00..1216.68 rows=65637 width=0) (actual time=.. rows= loops=)

  • Index Cond: (evt_act_key = 500000221)