explain.depesz.com

PostgreSQL's explain analyze made readable

Result: iOnQ

Settings
# exclusive inclusive rows x rows loops node
1. 2,732.927 3,003.046 ↓ 0.0 0 1

Insert on public.mjv_accounts_branches mv (cost=45.43..38,704.43 rows=500,000 width=20) (actual time=3,003.046..3,003.046 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: cnstr_mjv_accounts_branches_keys
  • Tuples Inserted: 0
  • Conflicting Tuples: 101002
  • Buffers: shared hit=1128717 read=1083, local hit=1
2. 270.086 270.119 ↑ 5.0 101,002 1

Hash Join (cost=45.43..38,704.43 rows=500,000 width=20) (actual time=0.048..270.119 rows=101,002 loops=1)

  • Output: acc.aid, acc.bid, acc.abalance, br.bid, br.bbalance
  • Hash Cond: (acc.bid = br.bid)
  • Buffers: shared hit=19915, local hit=1
  • -> Seq Scan on public.pgbench_accounts acc (cost=0.00..29909.00 rows=1000000 width=12) (actual time=0.006..123.559 rows=1000000
  • Output: acc.aid, acc.bid, acc.abalance, acc.filler
  • Buffers: shared hit=19909
3. 0.002 0.033 ↑ 5.0 1 1

Hash (cost=45.36..45.36 rows=5 width=16) (actual time=0.033..0.033 rows=1 loops=1)

  • Output: br.bid, br.bbalance, view_t_mjv_accounts_branches.bid
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
  • Buffers: shared hit=6, local hit=1
4. 0.009 0.031 ↑ 5.0 1 1

Hash Join (cost=41.73..45.36 rows=5 width=16) (actual time=0.030..0.031 rows=1 loops=1)

  • Output: br.bid, br.bbalance, view_t_mjv_accounts_branches.bid
  • Inner Unique: true
  • Hash Cond: (view_t_mjv_accounts_branches.bid = br.bid)
  • Buffers: shared hit=6, local hit=1
5. 0.008 0.008 ↑ 200.0 1 1

HashAggregate (cost=35.50..37.50 rows=200 width=8) (actual time=0.008..0.008 rows=1 loops=1)

  • Output: view_t_mjv_accounts_branches.bid
  • Group Key: view_t_mjv_accounts_branches.bid
  • Buffers: local hit=1
  • -> Seq Scan on pg_temp_7.view_t_mjv_accounts_branches (cost=0.00..30.40 rows=2040 width=8) (actual time=0.004.
  • Output: view_t_mjv_accounts_branches.bid, view_t_mjv_accounts_branches.bbalance
  • Buffers: local hit=1
6. 0.014 0.014 ↑ 1.0 10 1

Hash (cost=6.10..6.10 rows=10 width=8) (actual time=0.013..0.014 rows=10 loops=1)

  • Output: br.bid, br.bbalance
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
  • Buffers: shared hit=6
  • -> Seq Scan on public.pgbench_branches br (cost=0.00..6.10 rows=10 width=8) (actual time=0.003..0.010 rows=10
  • Output: br.bid, br.bbalance
  • Buffers: shared hit=6
Planning time : 0.316 ms
Execution time : 3,003.504 ms