explain.depesz.com

PostgreSQL's explain analyze made readable

Result: EQu3

Settings
# exclusive inclusive rows x rows loops node
1. 0.132 305,525.068 ↑ 1.0 100 1

Limit (cost=7,683,544.14..7,683,544.39 rows=100 width=582) (actual time=305,524.998..305,525.068 rows=100 loops=1)

2. 468.748 305,524.936 ↑ 213,526.2 500 1

Sort (cost=7,683,543.14..7,950,450.90 rows=106,763,104 width=582) (actual time=305,524.798..305,524.936 rows=500 loops=1)

  • Sort Key: reviews.date DESC, reviews."createdAt" DESC
  • Sort Method: top-N heapsort Memory: 333kB
3. 4,665.902 305,056.188 ↑ 137.6 776,083 1

WindowAgg (cost=1,500.69..2,363,652.82 rows=106,763,104 width=582) (actual time=304,496.992..305,056.188 rows=776,083 loops=1)

4. 804.721 300,390.286 ↑ 137.6 776,083 1

Nested Loop (cost=1,500.69..1,029,114.02 rows=106,763,104 width=582) (actual time=93.701..300,390.286 rows=776,083 loops=1)

5. 146.442 185.565 ↓ 500.0 100,000 1

HashAggregate (cost=1,500.00..1,502.00 rows=200 width=32) (actual time=90.745..185.565 rows=100,000 loops=1)

  • Group Key: "*VALUES*".column1
6. 39.123 39.123 ↑ 1.0 100,000 1

Values Scan on "*VALUES*" (cost=0.00..1,250.00 rows=100,000 width=32) (actual time=0.001..39.123 rows=100,000 loops=1)

7. 299,400.000 299,400.000 ↑ 158.4 8 100,000

Index Scan using review_pkey on reviews (cost=0.70..5,125.39 rows=1,267 width=582) (actual time=0.558..2.994 rows=8 loops=100,000)

  • Index Cond: ("uniqueHash" = "*VALUES*".column1)
Planning time : 76.420 ms
Execution time : 305,526.834 ms