explain.depesz.com

A tool for finding a real cause for slow queries.

Result: lMG

options
Did it help? Consider supporting us - Bitcoin address: 12v2hUztAk2LgzQ9H9LMwuU32urHMjZQnq
# exclusive inclusive rows x rows loops node
1. 0.047 0.240 ↑ 1.0 142 1

Hash Join (cost=7.70..17.17 rows=144 width=142) (actual time=0.116..0.240 rows=142 loops=1)

  • Hash Cond: (c1_.category_id = c0_.id)
2. 0.029 0.172 ↑ 1.0 71 1

Hash Join (cost=5.32..12.99 rows=72 width=114) (actual time=0.087..0.172 rows=71 loops=1)

  • Hash Cond: (s4_.capability_id = c1_.id)
3. 0.025 0.081 ↓ 1.0 63 1

Hash Join (cost=1.16..7.89 rows=61 width=13) (actual time=0.020..0.081 rows=63 loops=1)

  • Hash Cond: (s4_.service_offer_id = s5_.id)
4. 0.052 0.052 ↑ 1.0 137 1

Seq Scan on service_offer_capability s4_ (cost=0.00..5.60 rows=137 width=13) (actual time=0.005..0.052 rows=137 loops=1)

  • Filter: ((value)::text <> 'i:0;'::text)
5. 0.002 0.004 ↑ 1.0 4 1

Hash (cost=1.11..1.11 rows=4 width=4) (actual time=0.004..0.004 rows=4 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 1kB
6. 0.002 0.002 ↑ 1.0 4 1

Seq Scan on service_offer s5_ (cost=0.00..1.11 rows=4 width=4) (actual time=0.001..0.002 rows=4 loops=1)

  • Filter: (service_id = 2)
7. 0.020 0.062 ↑ 1.0 39 1

Hash (cost=3.67..3.67 rows=39 width=101) (actual time=0.062..0.062 rows=39 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 6kB
8. 0.023 0.042 ↑ 1.0 39 1

Hash Join (cost=1.74..3.67 rows=39 width=101) (actual time=0.022..0.042 rows=39 loops=1)

  • Hash Cond: (c3_.capability_id = c1_.id)
9. 0.004 0.004 ↑ 1.0 39 1

Seq Scan on capability_tr c3_ (cost=0.00..1.39 rows=39 width=60) (actual time=0.001..0.004 rows=39 loops=1)

10. 0.011 0.015 ↑ 1.0 33 1

Hash (cost=1.33..1.33 rows=33 width=41) (actual time=0.015..0.015 rows=33 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 3kB
11. 0.004 0.004 ↑ 1.0 33 1

Seq Scan on capability c1_ (cost=0.00..1.33 rows=33 width=41) (actual time=0.002..0.004 rows=33 loops=1)

12. 0.003 0.021 ↑ 1.0 8 1

Hash (cost=2.28..2.28 rows=8 width=28) (actual time=0.021..0.021 rows=8 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 1kB
13. 0.012 0.018 ↑ 1.0 8 1

Hash Join (cost=1.09..2.28 rows=8 width=28) (actual time=0.014..0.018 rows=8 loops=1)

  • Hash Cond: (c2_.category_id = c0_.id)
14. 0.003 0.003 ↑ 1.0 8 1

Seq Scan on capability_category_tr c2_ (cost=0.00..1.08 rows=8 width=20) (actual time=0.003..0.003 rows=8 loops=1)

15. 0.002 0.003 ↑ 1.0 4 1

Hash (cost=1.04..1.04 rows=4 width=8) (actual time=0.003..0.003 rows=4 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 1kB
16. 0.001 0.001 ↑ 1.0 4 1

Seq Scan on capability_category c0_ (cost=0.00..1.04 rows=4 width=8) (actual time=0.001..0.001 rows=4 loops=1)