#	exclusive	inclusive	rows x	rows	loops	node
1.	0.003	23.219	↑ 1.0	15	1	→ Limit (cost=10413.93..10413.96 rows=15 width=12) (actual time=23.217..23.219 rows=15 loops=1)
2.	0.559	23.216	↑ 113.8	15	1	→ Sort (cost=10413.93..10418.19 rows=1707 width=12) (actual time=23.216..23.216 rows=15 loops=1) Sort Key: replays_game.game_time Sort Method: top-N heapsort Memory: 25kB
3.	0.807	22.657	↑ 1.3	1289	1	→ Nested Loop (cost=7914.79..10372.05 rows=1707 width=12) (actual time=16.305..22.657 rows=1289 loops=1)
4.	1.462	16.694	↓ 2.9	1289	1	→ HashAggregate (cost=7914.79..7919.18 rows=439 width=4) (actual time=16.288..16.694 rows=1289 loops=1)
5.	15.232	15.232	↑ 1.3	1289	1	→ Index Scan using replays_playeringame_player_id on replays_playeringame (cost=0.00..7910.52 rows=1707 width=4) (actual time=0.101..15.232 rows=1289 loops=1) Index Cond: (player_id = 50027) Filter: ((win IS NOT NULL) AND (apm IS NOT NULL) AND (wpm IS NOT NULL) AND (apm > 0::double precision) AND (wpm > 0::double precision))
6.	5.156	5.156	↑ 1.0	1	1289	→ Index Scan using replays_game_pkey on replays_game (cost=0.00..5.57 rows=1 width=12) (actual time=0.004..0.004 rows=1 loops=1289) Index Cond: (id = replays_playeringame.game_id)

                                                                                      QUERY PLAN
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
 Limit  (cost=10413.93..10413.96 rows=15 width=12) (actual time=23.217..23.219 rows=15 loops=1)
   ->  Sort  (cost=10413.93..10418.19 rows=1707 width=12) (actual time=23.216..23.216 rows=15 loops=1)
         Sort Key: replays_game.game_time
         Sort Method: top-N heapsort  Memory: 25kB
         ->  Nested Loop  (cost=7914.79..10372.05 rows=1707 width=12) (actual time=16.305..22.657 rows=1289 loops=1)
               ->  HashAggregate  (cost=7914.79..7919.18 rows=439 width=4) (actual time=16.288..16.694 rows=1289 loops=1)
                     ->  Index Scan using replays_playeringame_player_id on replays_playeringame  (cost=0.00..7910.52 rows=1707 width=4) (actual time=0.101..15.232 rows=1289 loops=1)
                           Index Cond: (player_id = 50027)
                           Filter: ((win IS NOT NULL) AND (apm IS NOT NULL) AND (wpm IS NOT NULL) AND (apm > 0::double precision) AND (wpm > 0::double precision))
               ->  Index Scan using replays_game_pkey on replays_game  (cost=0.00..5.57 rows=1 width=12) (actual time=0.004..0.004 rows=1 loops=1289)
                     Index Cond: (id = replays_playeringame.game_id)

Per node type stats

node type	count	sum of times	% of query
HashAggregate	1	1.462 ms	6.3 %
Index Scan	2	20.388 ms	87.8 %
Limit	1	0.003 ms	0.0 %
Nested Loop	1	0.807 ms	3.5 %
Sort	1	0.559 ms	2.4 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
replays_game	1	5.156 ms	22.2 %
Index Scan	1	5.156 ms	100.0 %
replays_playeringame	1	15.232 ms	65.6 %
Index Scan	1	15.232 ms	100.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: oU3

Colorize:

Columns visibility:

Per node type stats

Per table stats