explain.depesz.com

PostgreSQL's explain analyze made readable

Result: N153 : 1

Settings
# exclusive inclusive rows x rows loops node
1. 596.523 16,504.522 ↓ 0.0 0 1

Nested Loop Left Join (cost=4.38..6,273.30 rows=1 width=697) (actual time=16,504.522..16,504.522 rows=0 loops=1)

  • Filter: (((COALESCE(((nvl(LEAST(nvl(p.inlevel, (max(inlevel))), nvl((max(inlevelmax)), 0)), nvl((max(inleveldefault)), 0))))::text, ''::text) = ''::text) AND (f.biisfolder = 1)) OR ((nvl(LEAST(nvl(p.inlevel, (max(inlevel))), nvl((max(inlevelmax)), 0)), n (...)
  • Rows Removed by Filter: 242847
2. 801.855 4,979.884 ↓ 242,847.0 242,847 1

Nested Loop Left Join (cost=1.80..6,254.07 rows=1 width=116) (actual time=0.077..4,979.884 rows=242,847 loops=1)

  • Join Filter: (efod.inidfso = efd.inidparent)
  • Rows Removed by Join Filter: 4128385
3. 676.212 3,449.488 ↓ 242,847.0 242,847 1

Nested Loop Left Join (cost=1.80..6,252.69 rows=1 width=99) (actual time=0.070..3,449.488 rows=242,847 loops=1)

  • Join Filter: (efd.inidfso = fd.inidfso)
  • Rows Removed by Join Filter: 242846
4. 552.168 2,530.429 ↓ 242,847.0 242,847 1

Nested Loop Left Join (cost=1.80..6,251.66 rows=1 width=80) (actual time=0.065..2,530.429 rows=242,847 loops=1)

  • Filter: (((fd.inidlock = 0) AND (fd.indone < 2)) OR ((fd.inidlock <> 0) AND (fd.indone > 0)) OR (COALESCE((fd.indone)::text, ''::text) = ''::text))
5. 305.521 521.179 ↓ 3,420.4 242,847 1

Hash Left Join (cost=1.38..5,831.01 rows=71 width=60) (actual time=0.044..521.179 rows=242,847 loops=1)

  • Hash Cond: (f.inidparent = fod.inidfso)
  • Filter: ((fod.inlockdeleted <> 0) OR (COALESCE((fod.inlockdeleted)::text, ''::text) = ''::text))
6. 215.641 215.641 ↓ 200.0 242,847 1

Seq Scan on stfsos f (cost=0.00..5,824.94 rows=1,214 width=43) (actual time=0.015..215.641 rows=242,847 loops=1)

  • Filter: ((biisfolder + 1) = 1)
  • Rows Removed by Filter: 16
7. 0.008 0.017 ↑ 1.0 17 1

Hash (cost=1.17..1.17 rows=17 width=25) (actual time=0.017..0.017 rows=17 loops=1)

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

Seq Scan on stfolderdescs fod (cost=0.00..1.17 rows=17 width=25) (actual time=0.003..0.009 rows=17 loops=1)

9. 1,457.082 1,457.082 ↑ 1.0 1 242,847

Index Scan using stfiledescs_pkey on stfiledescs fd (cost=0.42..5.90 rows=1 width=24) (actual time=0.006..0.006 rows=1 loops=242,847)

  • Index Cond: (inidfso = f.inidfso)
10. 242.847 242.847 ↑ 1.0 1 242,847

Seq Scan on edtfiledescs efd (cost=0.00..1.01 rows=1 width=27) (actual time=0.001..0.001 rows=1 loops=242,847)

11. 728.541 728.541 ↑ 1.0 17 242,847

Seq Scan on stfolderdescs efod (cost=0.00..1.17 rows=17 width=21) (actual time=0.001..0.003 rows=17 loops=242,847)

12. 2,428.470 10,928.115 ↑ 2.0 1 242,847

Hash Right Join (cost=2.58..18.92 rows=2 width=8) (actual time=0.042..0.045 rows=1 loops=242,847)

  • Hash Cond: (l.inlabel = v.inlabel)
13. 0.000 0.000 ↓ 0.0 0 242,829

Seq Scan on dslabels l (cost=0.00..14.60 rows=460 width=4) (actual time=0.000..0.000 rows=0 loops=242,829)

14. 485.694 8,499.645 ↑ 1.0 1 242,847

Hash (cost=2.56..2.56 rows=1 width=12) (actual time=0.035..0.035 rows=1 loops=242,847)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
15. 3,157.011 8,013.951 ↑ 1.0 1 242,847

Nested Loop Left Join (cost=1.15..2.56 rows=1 width=12) (actual time=0.032..0.033 rows=1 loops=242,847)

  • Join Filter: (v.inid = inidversion)
16. 242.919 4,856.940 ↑ 1.0 1 242,847

Nested Loop Left Join (cost=1.15..1.53 rows=1 width=20) (actual time=0.018..0.020 rows=1 loops=242,847)

17. 242.847 3,642.705 ↑ 1.0 1 242,847

Nested Loop Left Join (cost=0.86..1.18 rows=1 width=16) (actual time=0.014..0.015 rows=1 loops=242,847)

  • Join Filter: ((v.inidstate = inidstate) AND (m.inidtype = inidtype))
18. 728.631 3,399.858 ↑ 1.0 1 242,847

Nested Loop Left Join (cost=0.86..1.14 rows=1 width=16) (actual time=0.013..0.014 rows=1 loops=242,847)

19. 1,457.082 1,457.082 ↑ 1.0 1 242,847

Index Only Scan using stversions_inid_inidmain_inlabel_inidstate_idx on stversions v (cost=0.43..0.65 rows=1 width=16) (actual time=0.005..0.006 rows=1 loops=242,847)

  • Index Cond: (inid = fd.iniddocument)
  • Heap Fetches: 75
20. 1,214.145 1,214.145 ↑ 1.0 1 242,829

Index Scan using stmain_inid_idx on stmain m (cost=0.43..0.49 rows=1 width=8) (actual time=0.005..0.005 rows=1 loops=242,829)

  • Index Cond: (v.inidmain = inid)
21. 0.000 0.000 ↓ 0.0 0 242,829

HashAggregate (cost=0.00..0.01 rows=1 width=16) (actual time=0.000..0.000 rows=0 loops=242,829)

  • Group Key: inidtype, inidstate
22. 0.000 0.000 ↓ 0.0 0 1

Result (cost=0.00..0.00 rows=0 width=16) (actual time=0.000..0.000 rows=0 loops=1)

  • One-Time Filter: false
23. 242.829 971.316 ↓ 0.0 0 242,829

Nested Loop Semi Join (cost=0.29..0.34 rows=1 width=8) (actual time=0.004..0.004 rows=0 loops=242,829)

  • Join Filter: (p.iniduser = (NULL::integer))
  • Rows Removed by Join Filter: 0
24. 728.487 728.487 ↓ 0.0 0 242,829

Index Scan using idx_stprivileges_inidversion on stprivileges p (cost=0.29..0.31 rows=1 width=12) (actual time=0.003..0.003 rows=0 loops=242,829)

  • Index Cond: (v.inid = inidversion)
25. 0.000 0.000 ↑ 1.0 1 3,703

Result (cost=0.00..0.01 rows=1 width=4) (actual time=0.000..0.000 rows=1 loops=3,703)

26. 0.000 0.000 ↓ 0.0 0 242,829

HashAggregate (cost=0.00..0.01 rows=1 width=8) (actual time=0.000..0.000 rows=0 loops=242,829)

  • Group Key: inidversion
27. 0.000 0.000 ↓ 0.0 0 1

Result (cost=0.00..0.00 rows=0 width=8) (actual time=0.000..0.000 rows=0 loops=1)

  • One-Time Filter: false
Planning time : 3.950 ms
Execution time : 16,504.881 ms