explain.depesz.com

A tool for finding a real cause for slow queries.

Result: mpj

options
# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=13200.040..13445.660 rows=12281 width=130) (actual time=.. rows= loops=)

2. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=0.000..12893.020 rows=12281 width=130) (actual time=.. rows= loops=)

3. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=0.000..1546.960 rows=12281 width=123) (actual time=.. rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=0.000..185.030 rows=1 width=14) (actual time=.. rows= loops=)

  • Join Filter: (tango_mike.six = tango_mike2.mike_six)
5. 0.000 0.000 ↓ 0.0
→

Index Scan using lima on tango_golf tango_mike (cost=0.000..28.200 rows=1 width=14) (actual time=.. rows= loops=)

  • Index Cond: (mike_foxtrot = 1055602)
  • Filter: ((sierra = 4481502) AND ((xray_romeo)::text = 'seven'::text))
6. 0.000 0.000 ↓ 0.0
→

Index Scan using november_two on tango_golf uniform_six (cost=0.000..132.430 rows=1952 width=16) (actual time=.. rows= loops=)

7. 0.000 0.000 ↓ 0.0
→

Index Scan using four on kilo tango_five (cost=0.000..960.780 rows=32092 width=125) (actual time=.. rows= loops=)

  • Index Cond: (tango_five.xray_six = tango_mike2.xray_six)
8. 0.000 0.000 ↓ 0.0
→

Index Scan using papa on november_golf alpha (cost=0.000..0.910 rows=1 width=23) (actual time=.. rows= loops=)

  • Index Cond: (alpha.romeo = tango_five.uniform_victor)