# exclusive inclusive rows x rows loops node
1. 0.011 0.506 ↑ 32.0 1 1

Sort (cost=32.92..33 rows=32 width=224) (actual time=0.505..0.506 rows=1 loops=1)

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

Hash Join (cost=1.14..32.12 rows=32 width=224) (actual time=0.094..0.495 rows=1 loops=1)

3. 0.396 0.396 ↓ 2.0 127 1

Seq Scan on pg_class c (cost=0..29.89 rows=64 width=73) (actual time=0.024..0.396 rows=127 loops=1)

  • Filter: ((relkind = ANY ('{r,p,v,m,S,f,""}'::"char"[])) AND pg_table_is_visible(oid))
4. 0.007 0.051 ↑ 1.5 2 1

Hash (cost=1.1..1.1 rows=3 width=68) (actual time=0.051..0.051 rows=2 loops=1)

5. 0.044 0.044 ↑ 1.5 2 1

Seq Scan on pg_namespace n (cost=0..1.1 rows=3 width=68) (actual time=0.03..0.044 rows=2 loops=1)

  • Filter: ((nspname <> 'pg_catalog'::name) AND (nspname <> 'information_schema'::name) AND (nspname !~ '^pg_toast'::text))
Planning time : 0.593 ms
Execution time : 0.601 ms