explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Dmk6

Settings
# exclusive inclusive rows x rows loops node
1. 0.001 0.089 ↓ 0.0 0 1

Result (cost=362.63..380.17 rows=23 width=1,635) (actual time=0.088..0.089 rows=0 loops=1)

  • Output: f.inid, t.stname, t.bidocument, s.stname, f.stproduct, f.stversion, f.birevision, f.inaccess, v.inlabel, l.stlabelname, md_appserv.fnhaslink(t.inid), dt_locks.fnislocked(0, f.inidlock, i.iniduser, 3671), (nvl(rltypesort.inorder, 255))
2. 0.014 0.088 ↓ 0.0 0 1

Sort (cost=362.63..362.69 rows=23 width=1,639) (actual time=0.088..0.088 rows=0 loops=1)

  • Output: f.inid, t.stname, t.bidocument, s.stname, f.stproduct, f.stversion, f.birevision, f.inaccess, v.inlabel, l.stlabelname, (nvl(rltypesort.inorder, 255)), t.inid, f.inidlock, i.iniduser
  • Sort Key: (nvl(rltypesort.inorder, 255)), t.stname, f.stproduct
  • Sort Method: quicksort Memory: 25kB
3. 0.000 0.074 ↓ 0.0 0 1

Hash Left Join (cost=47.83..362.11 rows=23 width=1,639) (actual time=0.074..0.074 rows=0 loops=1)

  • Output: f.inid, t.stname, t.bidocument, s.stname, f.stproduct, f.stversion, f.birevision, f.inaccess, v.inlabel, l.stlabelname, nvl(rltypesort.inorder, 255), t.inid, f.inidlock, i.iniduser
  • Hash Cond: (v.inlabel = l.inlabel)
4. 0.001 0.074 ↓ 0.0 0 1

Nested Loop Left Join (cost=34.68..342.89 rows=23 width=1,123) (actual time=0.074..0.074 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, t.stname, t.bidocument, t.inid, s.stname, v.inlabel, i.iniduser, rltypesort.inorder
  • Inner Unique: true
5. 0.000 0.073 ↓ 0.0 0 1

Nested Loop (cost=34.40..274.12 rows=23 width=1,119) (actual time=0.073..0.073 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, t.stname, t.bidocument, t.inid, s.stname, v.inlabel, i.iniduser
  • Inner Unique: true
6. 0.013 0.073 ↓ 0.0 0 1

Hash Join (cost=33.97..79.82 rows=23 width=1,115) (actual time=0.073..0.073 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, t.stname, t.bidocument, t.inid, s.stname, i.iniduser
  • Hash Cond: (t.inid = f.inidtype)
7. 0.020 0.020 ↑ 264.0 1 1

Seq Scan on ora_dbo.dstypes t (cost=0.00..44.64 rows=264 width=37) (actual time=0.020..0.020 rows=1 loops=1)

  • Output: t.inid, t.stname, t.stdocpath, t.inidkeyattribute, t.indefaultstate, t.binoversions, t.biabstract, t.bidocument, t.bicanbeproject, t.imicon
8. 0.000 0.040 ↓ 0.0 0 1

Hash (cost=33.68..33.68 rows=23 width=1,082) (actual time=0.040..0.040 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, f.inidtype, s.stname, i.iniduser
  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
9. 0.009 0.040 ↓ 0.0 0 1

Hash Right Join (cost=21.52..33.68 rows=23 width=1,082) (actual time=0.040..0.040 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, f.inidtype, s.stname, i.iniduser
  • Hash Cond: (i.inid = f.inidlock)
10. 0.000 0.000 ↓ 0.0 0

Seq Scan on ora_dbo.stlockinfo i (cost=0.00..11.40 rows=140 width=8) (never executed)

  • Output: i.inid, i.iniduser, i.inlevel, i.dtdate, i.stcomments, i.inlabel
11. 0.000 0.031 ↓ 0.0 0 1

Hash (cost=21.23..21.23 rows=23 width=1,078) (actual time=0.031..0.031 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, f.inidtype, s.stname
  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
12. 0.015 0.031 ↓ 0.0 0 1

Hash Join (cost=11.16..21.23 rows=23 width=1,078) (actual time=0.031..0.031 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, f.inidtype, s.stname
  • Hash Cond: (s.inid = f.inidstate)
13. 0.009 0.009 ↑ 134.0 1 1

Seq Scan on ora_dbo.dsstates s (cost=0.00..9.34 rows=134 width=30) (actual time=0.009..0.009 rows=1 loops=1)

  • Output: s.inid, s.stname, s.imicon, s.bisavelinkhistory
14. 0.001 0.007 ↓ 0.0 0 1

Hash (cost=10.88..10.88 rows=23 width=1,056) (actual time=0.007..0.007 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, f.inidtype, f.inidstate
  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
15. 0.006 0.006 ↓ 0.0 0 1

Seq Scan on pg_temp_8.tmpfound f (cost=0.00..10.88 rows=23 width=1,056) (actual time=0.006..0.006 rows=0 loops=1)

  • Output: f.inid, f.stproduct, f.stversion, f.birevision, f.inaccess, f.inidlock, f.inidtype, f.inidstate
  • Filter: (f.inaccess > 0)
16. 0.000 0.000 ↓ 0.0 0

Index Scan using stversions_pkey on ora_dbo.stversions v (cost=0.43..8.45 rows=1 width=8) (never executed)

  • Output: v.inid, v.inidmain, v.inidstate, v.stnumber, v.inidparentversion, v.inowner, v.dtdateofcreate, v.dtmodified, v.birevision, v.inlabel, v.inlevel
  • Index Cond: (v.inid = f.inid)
17. 0.000 0.000 ↓ 0.0 0

Index Scan using rltypesort_pkey on ora_dbo.rltypesort (cost=0.29..2.99 rows=1 width=8) (never executed)

  • Output: rltypesort.inidcase, rltypesort.inidtype, rltypesort.inorder
  • Index Cond: ((rltypesort.inidcase = 1) AND (t.inid = rltypesort.inidtype))
18. 0.000 0.000 ↓ 0.0 0

Hash (cost=11.40..11.40 rows=140 width=520) (never executed)

  • Output: l.stlabelname, l.inlabel
19. 0.000 0.000 ↓ 0.0 0

Seq Scan on ora_dbo.dslabels l (cost=0.00..11.40 rows=140 width=520) (never executed)

  • Output: l.stlabelname, l.inlabel
Planning time : 2.203 ms
Execution time : 0.317 ms