explain.depesz.com

PostgreSQL's explain analyze made readable

Result: qeUr

Settings

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 0.001 220.631 ↓ 0.0 0 1

Nested Loop Semi Join (cost=2,257.51..206,992.05 rows=91 width=183) (actual time=220.631..220.631 rows=0 loops=1)

  • Buffers: shared hit=166 read=219 dirtied=3
  • I/O Timings: read=216.969
2. 220.630 220.630 ↓ 0.0 0 1

Index Scan using merge_request_diffs_pkey on public.merge_request_diffs (cost=0.57..921.05 rows=91 width=183) (actual time=220.630..220.630 rows=0 loops=1)

  • Index Cond: ((merge_request_diffs.id >= 1) AND (merge_request_diffs.id <= 1,000))
  • Filter: (merge_request_diffs.stored_externally AND ((merge_request_diffs.state)::text <> ALL ('{without_files,empty}'::text[])) AND (merge_request_diffs.external_diff_store = 1))
  • Rows Removed by Filter: 899
  • Buffers: shared hit=166 read=219 dirtied=3
  • I/O Timings: read=216.969
3. 0.000 0.000 ↓ 0.0 0 0

Nested Loop Semi Join (cost=2,256.95..2,264.51 rows=1 width=4) (actual time=0.000..0.000 rows=0 loops=0)

4. 0.000 0.000 ↓ 0.0 0 0

Index Scan using merge_requests_pkey on public.merge_requests (cost=0.56..3.58 rows=1 width=8) (actual time=0.000..0.000 rows=0 loops=0)

  • Index Cond: (merge_requests.id = merge_request_diffs.merge_request_id)
5. 0.000 0.000 ↓ 0.0 0 0

Nested Loop (cost=2,256.38..2,260.91 rows=1 width=4) (actual time=0.000..0.000 rows=0 loops=0)

6. 0.000 0.000 ↓ 0.0 0 0

Index Scan using projects_pkey on public.projects (cost=0.43..0.47 rows=1 width=8) (actual time=0.000..0.000 rows=0 loops=0)

  • Index Cond: (projects.id = merge_requests.target_project_id)
7. 0.000 0.000 ↓ 0.0 0 0

HashAggregate (cost=2,255.95..2,257.95 rows=200 width=4) (actual time=0.000..0.000 rows=0 loops=0)

  • Group Key: namespaces.id
8. 0.000 0.000 ↓ 0.0 0 0

CTE Scan on base_and_descendants namespaces (cost=2,074.04..2,185.98 rows=5,597 width=4) (actual time=0.000..0.000 rows=0 loops=0)

9.          

CTE base_and_descendants

10. 0.000 0.000 ↓ 0.0 0 0

Recursive Union (cost=0.15..2,074.04 rows=5,597 width=4) (actual time=0.000..0.000 rows=0 loops=0)

11. 0.000 0.000 ↓ 0.0 0 0

Index Only Scan using index_geo_node_namespace_links_on_geo_node_id_and_namespace_id on public.geo_node_namespace_links (cost=0.15..10.78 rows=7 width=4) (actual time=0.000..0.000 rows=0 loops=0)

  • Index Cond: (geo_node_namespace_links.geo_node_id = 100,109)
  • Heap Fetches: 0
12. 0.000 0.000 ↓ 0.0 0 0

Nested Loop (cost=0.56..195.13 rows=559 width=4) (actual time=0.000..0.000 rows=0 loops=0)

13. 0.000 0.000 ↓ 0.0 0 0

WorkTable Scan on base_and_descendants (cost=0.00..1.40 rows=70 width=4) (actual time=0.000..0.000 rows=0 loops=0)

14. 0.000 0.000 ↓ 0.0 0 0

Index Only Scan using index_namespaces_on_parent_id_and_id on public.namespaces namespaces_1 (cost=0.56..2.69 rows=8 width=8) (actual time=0.000..0.000 rows=0 loops=0)

  • Index Cond: (namespaces_1.parent_id = base_and_descendants.id)
  • Heap Fetches: 0