explain.depesz.com

PostgreSQL's explain analyze made readable

Result: T3YO

Settings
# exclusive inclusive rows x rows loops node
1. 0.479 12.171 ↓ 174.0 174 1

GroupAggregate (cost=35.95..35.98 rows=1 width=97) (actual time=11.653..12.171 rows=174 loops=1)

  • Group Key: bcl.claim_id, bcl.bill_no, bcl.priority
  • Planning time: 3.631 ms
  • Execution time: 12.468 ms
2. 1.837 11.692 ↓ 560.0 560 1

Sort (cost=35.95..35.95 rows=1 width=40) (actual time=11.626..11.692 rows=560 loops=1)

  • Sort Key: bcl.claim_id, bcl.bill_no, bcl.priority
  • Sort Method: quicksort Memory: 68kB
3. 0.596 9.855 ↓ 560.0 560 1

Nested Loop (cost=8.53..35.94 rows=1 width=40) (actual time=0.526..9.855 rows=560 loops=1)

4. 1.808 2.406 ↓ 623.0 623 1

Hash Join (cost=8.25..35.03 rows=1 width=63) (actual time=0.483..2.406 rows=623 loops=1)

  • Hash Cond: (("substring"((bcc.bill_no)::text, 5, 2) = "substring"((bcl.bill_no)::text, 5, 2)) AND ((bcc.bill_no)::text = (bcl.bill_no)::text) AND ((bcc.claim_id)::text = (bcl.claim_id)::text))
5. 0.181 0.181 ↓ 1.0 623 1

Seq Scan on bill_charge_claim bcc (cost=0.00..18.22 rows=622 width=45) (actual time=0.018..0.181 rows=623 loops=1)

6. 0.303 0.417 ↓ 1.0 192 1

Hash (cost=4.91..4.91 rows=191 width=33) (actual time=0.417..0.417 rows=192 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 21kB
7. 0.114 0.114 ↓ 1.0 192 1

Seq Scan on bill_claim bcl (cost=0.00..4.91 rows=191 width=33) (actual time=0.010..0.114 rows=192 loops=1)

8. 6.853 6.853 ↑ 1.0 1 623

Index Scan using bill_charge_pkey on bill_charge bc (cost=0.28..0.89 rows=1 width=23) (actual time=0.011..0.011 rows=1 loops=623)

  • Index Cond: ((charge_id)::text = (bcc.charge_id)::text)
  • Filter: ((status <> 'X'::bpchar) AND ("substring"((bcc.bill_no)::text, 5, 2) = "substring"((bill_no)::text, 5, 2)))
  • Rows Removed by Filter: 0