explain.depesz.com

A tool for finding a real cause for slow queries.

Result: bCc

options
Did it help? Consider supporting us - Bitcoin address: 12v2hUztAk2LgzQ9H9LMwuU32urHMjZQnq
# exclusive inclusive rows x rows loops node
1. 5,982.437 40,931.202 ↓ 3,066.9 1,005,931 1

Sort (cost=94,310.33..94,311.15 rows=328 width=56) (actual time=39,970.546..40,931.202 rows=1,005,931 loops=1)

  • Sort Key: "_F2".title
  • Sort Method: external merge Disk: 64752kB
2. 893.477 34,948.765 ↓ 3,066.9 1,005,931 1

Nested Loop Left Join (cost=82,904.45..94,296.62 rows=328 width=56) (actual time=1,910.467..34,948.765 rows=1,005,931 loops=1)

3. 246.807 25,001.909 ↓ 3,066.9 1,005,931 1

Nested Loop (cost=82,904.45..93,910.05 rows=328 width=37) (actual time=1,910.450..25,001.909 rows=1,005,931 loops=1)

4. 377.216 14,695.792 ↓ 1,923.4 1,005,931 1

Nested Loop (cost=82,904.45..90,465.64 rows=523 width=74) (actual time=1,910.429..14,695.792 rows=1,005,931 loops=1)

5. 1,662.652 2,633.463 ↓ 989.1 1,062,283 1

HashAggregate (cost=82,904.45..82,915.19 rows=1,074 width=37) (actual time=1,910.377..2,633.463 rows=1,062,283 loops=1)

6. 970.811 970.811 ↓ 989.1 1,062,283 1

Seq Scan on ancestors (cost=0.00..82,901.76 rows=1,074 width=37) (actual time=0.017..970.811 rows=1,062,283 loops=1)

  • Filter: ('{1a12c0ec-4728-44d5-902c-a58241d13634}'::character varying[] <@ ancestors)
7. 11,685.113 11,685.113 ↑ 1.0 1 1,062,283

Index Scan using hierarchy_pk on hierarchy (cost=0.00..7.02 rows=1 width=37) (actual time=0.010..0.011 rows=1 loops=1,062,283)

  • Index Cond: ((id)::text = (ancestors.id)::text)
  • Filter: (((primarytype)::text = ANY ('{Picture,File,Audio,Video}'::text[])) OR ('{Asset}'::character varying[] <@ mixintypes))
8. 10,059.310 10,059.310 ↑ 1.0 1 1,005,931

Index Scan using misc_pk on misc "_F1" (cost=0.00..6.57 rows=1 width=37) (actual time=0.009..0.010 rows=1 loops=1,005,931)

  • Index Cond: ((id)::text = (hierarchy.id)::text)
  • Filter: ((lifecyclestate)::text <> 'deleted'::text)
9. 9,053.379 9,053.379 ↑ 1.0 1 1,005,931

Index Scan using dublincore_pk on dublincore "_F2" (cost=0.00..1.17 rows=1 width=55) (actual time=0.009..0.009 rows=1 loops=1,005,931)

  • Index Cond: ((hierarchy.id)::text = (id)::text)