explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Dxf2

Settings
# exclusive inclusive rows x rows loops node
1. 0.007 0.113 ↓ 2.5 5 1

Unique (cost=2.54..2.55 rows=2 width=36) (actual time=0.107..0.113 rows=5 loops=1)

  • Output: all_locations.id, all_locations.name
  • Buffers: shared hit=2
2. 0.021 0.106 ↓ 2.5 5 1

Sort (cost=2.54..2.54 rows=2 width=36) (actual time=0.105..0.106 rows=5 loops=1)

  • Output: all_locations.id, all_locations.name
  • Sort Key: all_locations.id, all_locations.name
  • Sort Method: quicksort Memory: 25kB
  • Buffers: shared hit=2
3. 0.013 0.085 ↓ 2.5 5 1

Nested Loop (cost=0.00..2.53 rows=2 width=36) (actual time=0.072..0.085 rows=5 loops=1)

  • Output: all_locations.id, all_locations.name
  • Join Filter: ((all_locations.pre <= l.pre) AND (all_locations.post >= l.post))
  • Rows Removed by Join Filter: 9
  • Buffers: shared hit=2
4. 0.051 0.051 ↑ 1.0 1 1

Seq Scan on public.v1_location l (cost=0.00..1.18 rows=1 width=8) (actual time=0.048..0.051 rows=1 loops=1)

  • Output: l.id, l.name, l.pre, l.post
  • Filter: (l.id = 6)
  • Rows Removed by Filter: 13
  • Buffers: shared hit=1
5. 0.021 0.021 ↑ 1.0 14 1

Seq Scan on public.v1_location all_locations (cost=0.00..1.14 rows=14 width=44) (actual time=0.018..0.021 rows=14 loops=1)

  • Output: all_locations.id, all_locations.name, all_locations.pre, all_locations.post
  • Buffers: shared hit=1
Planning time : 0.434 ms