| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..29316478.27 rows=3116 width=299) (actual time=.. rows= loops=)
|
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on object_activity_feed f (cost=0.00..3149.51 rows=6231 width=40) (actual time=.. rows= loops=)
|
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pk_activity_id on activity a (cost=0.00..3.93 rows=1 width=259) (actual time=.. rows= loops=)
|
||
| 4. |
SubPlan (forNested Loop) |
|||||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Limit (cost=4700.12..4700.37 rows=100 width=24) (actual time=.. rows= loops=) |
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=4700.12..4704.73 rows=1846 width=24) (actual time=.. rows= loops=)
|
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=4606.49..4629.57 rows=1846 width=24) (actual time=.. rows= loops=) |
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on object_activity_feed f (cost=632.08..4585.72 rows=4154 width=24) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on idx_object_activity_feed_object_id (cost=0.00..631.04 rows=6231 width=0) (actual time=.. rows= loops=)
|