| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Limit (cost=293874.88..293874.89 rows=2 width=24) (actual time=.. rows= loops=) |
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=293874.88..293882.85 rows=3188 width=24) (actual time=.. rows= loops=)
|
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=293811.12..293843.00 rows=3188 width=24) (actual time=.. rows= loops=) |
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=5973.94..293795.18 rows=3188 width=24) (actual time=.. rows= loops=)
|
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=3342.23..289087.68 rows=233591 width=16) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on poi mp (cost=3339.33..271614.48 rows=3026877 width=20) (actual time=.. rows= loops=)
|
||
| 7. |
SubPlan (forSeq Scan) |
|||||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=223.30..3339.33 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on sub_areas_information ms (cost=0.00..3115.68 rows=92 width=4) (actual time=.. rows= loops=)
|
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=211.25..211.25 rows=964 width=4) (actual time=.. rows= loops=) |
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using idx_maponics_area_is_supported on area ma (cost=0.00..211.25 rows=964 width=4) (actual time=.. rows= loops=)
|
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.66..2.66 rows=19 width=2) (actual time=.. rows= loops=) |
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on event_type_category etc (cost=0.00..2.66 rows=19 width=2) (actual time=.. rows= loops=)
|
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1599.09..1599.09 rows=82609 width=24) (actual time=.. rows= loops=) |
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on poi_score ps (cost=0.00..1599.09 rows=82609 width=24) (actual time=.. rows= loops=) |