explain.depesz.com

PostgreSQL's explain analyze made readable

Result: KrT2 : base plan for \d from psql

options

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 0.022 0.515 ↑ 32.0 1 1

Sort (cost=29.29..29.37 rows=32 width=224) (actual time=0.514..0.515 rows=1 loops=1)

  • Sort Key: n.nspname, c.relname
  • Sort Method: quicksort Memory: 25kB
2. 0.060 0.493 ↑ 32.0 1 1

Hash Join (cost=1.14..28.49 rows=32 width=224) (actual time=0.125..0.493 rows=1 loops=1)

  • Hash Cond: (c.relnamespace = n.oid)
3. 0.372 0.372 ↓ 1.9 122 1

Seq Scan on pg_class c (cost=0.00..25.92 rows=63 width=73) (actual time=0.018..0.372 rows=122 loops=1)

  • Filter: ((relkind = ANY ('{r,p,v,m,S,f,""}'::"char"[])) AND pg_table_is_visible(oid))
  • Rows Removed by Filter: 220
4. 0.010 0.061 ↑ 1.5 2 1

Hash (cost=1.10..1.10 rows=3 width=68) (actual time=0.061..0.061 rows=2 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
5. 0.051 0.051 ↑ 1.5 2 1

Seq Scan on pg_namespace n (cost=0.00..1.10 rows=3 width=68) (actual time=0.035..0.051 rows=2 loops=1)

  • Filter: ((nspname <> 'pg_catalog'::name) AND (nspname <> 'information_schema'::name) AND (nspname !~ '^pg_toast'::text))
  • Rows Removed by Filter: 4