explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 1yde : Optimization for: plan #ilid

Settings

Optimization path:

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 0.015 0.065 ↑ 1.0 8 1

Hash Join (cost=2.51..3.34 rows=8 width=193) (actual time=0.053..0.065 rows=8 loops=1)

  • Hash Cond: (da.c_datasetsid = ds.c_datasetsid)
2. 0.010 0.037 ↑ 1.0 8 1

Merge Join (cost=1.33..2.13 rows=8 width=123) (actual time=0.031..0.037 rows=8 loops=1)

  • Merge Cond: (d.c_datastoresid = da.c_datastoresid)
3. 0.005 0.005 ↑ 1.2 4 1

Index Scan using t_e20so1_datastores_pkey on t_e20so1_datastores d (cost=0.13..3.51 rows=5 width=67) (actual time=0.004..0.005 rows=4 loops=1)

4. 0.018 0.022 ↑ 1.0 8 1

Sort (cost=1.20..1.22 rows=8 width=56) (actual time=0.021..0.022 rows=8 loops=1)

  • Sort Key: da.c_datastoresid
  • Sort Method: quicksort Memory: 26kB
5. 0.004 0.004 ↑ 1.0 8 1

Seq Scan on t_e20so1_datasetsassociation da (cost=0.00..1.08 rows=8 width=56) (actual time=0.003..0.004 rows=8 loops=1)

6. 0.006 0.013 ↑ 1.0 8 1

Hash (cost=1.08..1.08 rows=8 width=70) (actual time=0.013..0.013 rows=8 loops=1)

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

Seq Scan on t_e20so1_datasets ds (cost=0.00..1.08 rows=8 width=70) (actual time=0.006..0.007 rows=8 loops=1)

Planning time : 0.452 ms