explain.depesz.com

PostgreSQL's explain analyze made readable

Result: ABbr

Settings
# exclusive inclusive rows x rows loops node
1. 0.000 0.038 ↑ 2.0 1 1

Limit (cost=19.47..19.48 rows=2 width=32) (actual time=0.038..0.038 rows=1 loops=1)

2. 0.001 0.038 ↑ 2.0 1 1

Unique (cost=19.47..19.48 rows=2 width=32) (actual time=0.037..0.038 rows=1 loops=1)

3. 0.004 0.037 ↑ 2.0 1 1

Sort (cost=19.47..19.48 rows=2 width=32) (actual time=0.037..0.037 rows=1 loops=1)

  • Sort Key: ebresp.bvu_response_id
  • Sort Method: quicksort Memory: 25kB
4. 0.002 0.033 ↑ 2.0 1 1

Nested Loop (cost=12.33..19.46 rows=2 width=32) (actual time=0.032..0.033 rows=1 loops=1)

5. 0.010 0.026 ↑ 1.0 1 1

Hash Join (cost=8.16..9.94 rows=1 width=516) (actual time=0.026..0.026 rows=1 loops=1)

  • Hash Cond: ((o_bvurequest_contract.bvurequest)::numeric = ebr.bvu_request_id)
6. 0.007 0.007 ↓ 1.1 54 1

Seq Scan on o_bvurequest_contract (cost=0.00..1.51 rows=51 width=8) (actual time=0.005..0.007 rows=54 loops=1)

7. 0.001 0.009 ↑ 1.0 1 1

Hash (cost=8.15..8.15 rows=1 width=548) (actual time=0.009..0.009 rows=1 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
8. 0.008 0.008 ↑ 1.0 1 1

Index Scan using bvu_request_bik_index on esb_electronic_bvu_request ebr (cost=0.14..8.15 rows=1 width=548) (actual time=0.007..0.008 rows=1 loops=1)

  • Index Cond: ((bik)::text = 'HSBKKZKX'::text)
9. 0.002 0.005 ↑ 2.0 1 1

Bitmap Heap Scan on esb_electronic_bvu_response ebresp (cost=4.16..9.50 rows=2 width=82) (actual time=0.005..0.005 rows=1 loops=1)

  • Recheck Cond: ((doc_ref)::text = (ebr.bvu_ref)::text)
  • Heap Blocks: exact=1
10. 0.003 0.003 ↑ 2.0 1 1

Bitmap Index Scan on bvu_response_doc_ref_index (cost=0.00..4.16 rows=2 width=0) (actual time=0.003..0.003 rows=1 loops=1)

  • Index Cond: ((doc_ref)::text = (ebr.bvu_ref)::text)