explain.depesz.com

A tool for finding a real cause for slow queries.

Result: X6N7 : Having test

options
# exclusive inclusive rows x rows loops node
1. 0.016 123.735 ↑ 9.1 30 1
→

Unique (cost=5968.670..5977.540 rows=273 width=14) (actual time=123.110..123.735 rows=30 loops=1)

2. 0.721 123.719 ↑ 9.1 30 1
→

GroupAggregate (cost=5968.670..5976.860 rows=273 width=14) (actual time=123.107..123.719 rows=30 loops=1)

  • Filter: ((five_two(DISTINCT five_hotel.echo) = 1) AND (five_two(DISTINCT quebec_sierra.echo) = 2))
3. 0.217 122.998 ↑ 1.4 200 1
→

Sort (cost=5968.670..5969.350 rows=273 width=14) (actual time=122.962..122.998 rows=200 loops=1)

  • Sort Key: quebec_three.sierra
  • Sort Method: quicksort Memory: 34kB
4. 0.550 122.781 ↑ 1.4 200 1
→

Hash Join (cost=2308.200..5957.620 rows=273 width=14) (actual time=51.121..122.781 rows=200 loops=1)

  • Hash Cond: (quebec_sierra.sierra = quebec_three.sierra)
5. 84.209 84.209 ↓ 1.3 1985 1
→

Seq Scan on papa quebec_sierra (cost=0.000..3641.060 rows=1501 width=9) (actual time=13.056..84.209 rows=1985 loops=1)

  • Filter: (echo = ANY ('foxtrot'::text[]))
6. 0.049 38.022 ↑ 2.0 138 1
→

Hash (cost=2304.790..2304.790 rows=273 width=13) (actual time=38.022..38.022 rows=138 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 7kB
7. 0.234 37.973 ↑ 2.0 138 1
→

Hash Join (cost=17.140..2304.790 rows=273 width=13) (actual time=10.025..37.973 rows=138 loops=1)

  • Hash Cond: (five_hotel.sierra = quebec_three.sierra)
8. 37.465 37.465 ↓ 1.2 793 1
→

Seq Scan on papa five_hotel (cost=0.000..2282.530 rows=638 width=9) (actual time=8.324..37.465 rows=793 loops=1)

  • Filter: (echo = ANY ('charlie'::text[]))
9. 0.085 0.274 ↑ 1.0 273 1
→

Hash (cost=13.730..13.730 rows=273 width=4) (actual time=0.274..0.274 rows=273 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 10kB
10. 0.189 0.189 ↑ 1.0 273 1
→

Seq Scan on four quebec_three (cost=0.000..13.730 rows=273 width=4) (actual time=0.006..0.189 rows=273 loops=1)