explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 6OIR

Settings
# exclusive inclusive rows x rows loops node
1. 0.011 2.355 ↑ 1.0 20 1

Limit (cost=37.41..38.01 rows=20 width=72) (actual time=2.330..2.355 rows=20 loops=1)

2. 0.013 2.344 ↑ 14.1 20 1

Result (cost=37.41..45.87 rows=282 width=72) (actual time=2.329..2.344 rows=20 loops=1)

3. 0.055 2.331 ↑ 14.1 20 1

Sort (cost=37.41..38.11 rows=282 width=44) (actual time=2.327..2.331 rows=20 loops=1)

  • Sort Key: (pg_total_relation_size((c.oid)::regclass)) DESC
  • Sort Method: top-N heapsort Memory: 27kB
4. 2.023 2.276 ↑ 3.0 94 1

Hash Join (cost=1.38..29.90 rows=282 width=44) (actual time=0.065..2.276 rows=94 loops=1)

  • Hash Cond: (c.relnamespace = n.oid)
5. 0.220 0.220 ↓ 1.0 354 1

Seq Scan on pg_class c (cost=0.00..23.82 rows=352 width=72) (actual time=0.008..0.220 rows=354 loops=1)

  • Filter: (relkind <> 'i'::"char")
  • Rows Removed by Filter: 277
6. 0.008 0.033 ↑ 1.1 11 1

Hash (cost=1.23..1.23 rows=12 width=68) (actual time=0.032..0.033 rows=11 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 10kB
7. 0.025 0.025 ↑ 1.1 11 1

Seq Scan on pg_namespace n (cost=0.00..1.23 rows=12 width=68) (actual time=0.010..0.025 rows=11 loops=1)

  • Filter: ((nspname <> ALL ('{pg_catalog,information_schema}'::name[])) AND (nspname !~ '^pg_toast'::text))
  • Rows Removed by Filter: 4
Planning time : 0.229 ms
Execution time : 2.395 ms