explain.depesz.com

PostgreSQL's explain analyze made readable

Result: qS9w : Optimization for: plan #nlNk

Settings

Optimization path:

# exclusive inclusive rows x rows loops node
1. 0.004 3.965 ↓ 1.6 8 1

Subquery Scan on items_0 (cost=1,720.33..1,720.82 rows=5 width=8) (actual time=3.942..3.965 rows=8 loops=1)

  • Filter: (items_0.ingredient_ranking <= 1)
  • Rows Removed by Filter: 14
2. 0.030 3.961 ↓ 1.5 22 1

WindowAgg (cost=1,720.33..1,720.63 rows=15 width=433) (actual time=3.941..3.961 rows=22 loops=1)

3. 0.014 3.931 ↓ 1.5 22 1

Sort (cost=1,720.33..1,720.37 rows=15 width=16) (actual time=3.929..3.931 rows=22 loops=1)

  • Sort Key: recipe_ingredient_products.ingredient_id, a.ordinality
  • Sort Method: quicksort Memory: 26kB
4. 0.005 3.917 ↓ 1.5 22 1

Nested Loop Left Join (cost=1,601.00..1,720.04 rows=15 width=16) (actual time=3.803..3.917 rows=22 loops=1)

  • Filter: (COALESCE(items_availabilities.availability_score, '0.87'::double precision) > '0.525'::double precision)
5. 0.018 3.846 ↑ 2.0 22 1

Hash Join (cost=1,600.72..1,643.57 rows=45 width=28) (actual time=3.793..3.846 rows=22 loops=1)

  • Hash Cond: (a.product_id = items_0_1.product_id)
6. 0.010 0.069 ↑ 6.6 68 1

Nested Loop (cost=20.20..61.88 rows=450 width=16) (actual time=0.029..0.069 rows=68 loops=1)

7. 0.010 0.029 ↑ 4.5 10 1

Hash Join (cost=20.20..52.87 rows=45 width=36) (actual time=0.023..0.029 rows=10 loops=1)

  • Hash Cond: (recipe_ingredient_products.ingredient_id = recipe_ingredients.ingredient_id)
8. 0.006 0.006 ↑ 158.8 8 1

Seq Scan on recipe_ingredient_products (cost=0.00..22.70 rows=1,270 width=36) (actual time=0.005..0.006 rows=8 loops=1)

9. 0.004 0.013 ↑ 4.5 10 1

Hash (cost=19.64..19.64 rows=45 width=4) (actual time=0.013..0.013 rows=10 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 9kB
10. 0.004 0.009 ↑ 4.5 10 1

Bitmap Heap Scan on recipe_ingredients (cost=8.96..19.64 rows=45 width=4) (actual time=0.008..0.009 rows=10 loops=1)

  • Recheck Cond: (recipe_id = ANY ('{1,2,3,4}'::integer[]))
  • Heap Blocks: exact=1
11. 0.005 0.005 ↑ 4.5 10 1

Bitmap Index Scan on index_recipe_ingredients_on_recipe_id_and_ingredient_id (cost=0.00..8.95 rows=45 width=0) (actual time=0.005..0.005 rows=10 loops=1)

  • Index Cond: (recipe_id = ANY ('{1,2,3,4}'::integer[]))
12. 0.030 0.030 ↑ 1.4 7 10

Function Scan on unnest a (cost=0.00..0.10 rows=10 width=12) (actual time=0.002..0.003 rows=7 loops=10)

13. 0.438 3.759 ↓ 2.5 2,054 1

Hash (cost=1,570.16..1,570.16 rows=828 width=16) (actual time=3.759..3.759 rows=2,054 loops=1)

  • Buckets: 4,096 (originally 1024) Batches: 1 (originally 1) Memory Usage: 137kB
14. 2.335 3.321 ↓ 2.5 2,054 1

Bitmap Heap Scan on items_0 items_0_1 (cost=183.11..1,570.16 rows=828 width=16) (actual time=1.087..3.321 rows=2,054 loops=1)

  • Recheck Cond: (inventory_area_id = 20,636)
  • Filter: (available AND visible AND (retailer_id = 29))
  • Heap Blocks: exact=1,067
15. 0.068 0.986 ↓ 0.0 0 1

BitmapAnd (cost=183.11..183.11 rows=828 width=0) (actual time=0.986..0.986 rows=0 loops=1)

16. 0.473 0.473 ↑ 1.0 4,404 1

Bitmap Index Scan on search_index_v2_items_0 (cost=0.00..49.03 rows=4,404 width=0) (actual time=0.473..0.473 rows=4,404 loops=1)

  • Index Cond: (inventory_area_id = 20,636)
17. 0.445 0.445 ↓ 1.8 6,025 1

Bitmap Index Scan on items_0_available_visible_idx (cost=0.00..133.42 rows=3,313 width=0) (actual time=0.445..0.445 rows=6,025 loops=1)

  • Index Cond: ((available = true) AND (visible = true))
18. 0.066 0.066 ↑ 1.0 1 22

Index Scan using items_availabilities_0_item_id_idx on items_availabilities_0 items_availabilities (cost=0.29..1.69 rows=1 width=20) (actual time=0.003..0.003 rows=1 loops=22)

  • Index Cond: (item_id = items_0_1.item_id)
  • Filter: ((inventory_area_id = 20,636) AND (inventory_area_id = items_0_1.inventory_area_id))
Planning time : 3.080 ms
Execution time : 4.057 ms