# Pastebin VVMUqkIc
warehouse=> explain analyze select name, sum(size) from release_files group by name order by 2 desc limit 100;
                                                                          QUERY PLAN                                                                           
---------------------------------------------------------------------------------------------------------------------------------------------------------------
 Limit  (cost=97655.20..97655.45 rows=100 width=20) (actual time=1045.216..1045.273 rows=100 loops=1)
   ->  Sort  (cost=97655.20..97762.03 rows=42735 width=20) (actual time=1045.215..1045.235 rows=100 loops=1)
         Sort Key: (sum(size)) DESC
         Sort Method: top-N heapsort  Memory: 36kB
         ->  Finalize HashAggregate  (cost=95594.54..96021.89 rows=42735 width=20) (actual time=962.670..1004.441 rows=134342 loops=1)
               Group Key: name
               ->  Gather  (cost=86192.84..95167.19 rows=85470 width=20) (actual time=632.641..815.825 rows=291019 loops=1)
                     Workers Planned: 2
                     Workers Launched: 2
                     ->  Partial HashAggregate  (cost=85192.84..85620.19 rows=42735 width=20) (actual time=630.096..672.876 rows=97006 loops=3)
                           Group Key: name
                           ->  Parallel Seq Scan on release_files  (cost=0.00..82261.23 rows=586323 width=16) (actual time=0.006..312.413 rows=459802 loops=3)
 Planning time: 0.098 ms
 Execution time: 1047.587 ms