explain.depesz.com

PostgreSQL's explain analyze made readable

Result: iHjj : Optimization for: Optimization for: plan #ilid; plan #1yde

Settings

Optimization path:

# exclusive inclusive rows x rows loops node
1. 0.010 0.039 ↑ 1.0 8 1

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

  • Hash Cond: (da.c_datasetsid = dt.c_datasetsid)
2. 0.007 0.020 ↑ 1.0 8 1

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

  • Merge Cond: (ds.c_datastoresid = da.c_datastoresid)
3. 0.004 0.004 ↑ 1.2 4 1

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

4. 0.007 0.009 ↑ 1.0 8 1

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

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

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

6. 0.003 0.009 ↑ 1.0 8 1

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

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

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

Planning time : 0.277 ms