#	exclusive	inclusive	rows x	rows	loops	node
1.	0.591	6.971	↑ 1.0	200	1	→ Sort (cost=79.14..79.64 rows=200 width=125) (actual time=6.775..6.971 rows=200 loops=1) Sort Key: financeoperations.date Sort Method: quicksort Memory: 78kB
2.	1.516	6.380	↑ 1.0	200	1	→ Hash Join (cost=37.75..71.50 rows=200 width=125) (actual time=3.766..6.380 rows=200 loops=1) Hash Cond: (partners.id = financeoperations.partner_id)
3.	1.180	1.180	↑ 1.0	1000	1	→ Seq Scan on partners (cost=0.00..28.00 rows=1000 width=105) (actual time=0.009..1.180 rows=1000 loops=1)
4.	0.307	3.684	↑ 1.0	200	1	→ Hash (cost=35.25..35.25 rows=200 width=28) (actual time=3.684..3.684 rows=200 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 12kB
5.	1.540	3.377	↑ 1.0	200	1	→ Hash Join (cost=12.50..35.25 rows=200 width=28) (actual time=0.656..3.377 rows=200 loops=1) Hash Cond: (financeoperations.goodsoperation_id = goodsoperations.id)
6.	1.216	1.216	↑ 1.0	1000	1	→ Seq Scan on financeoperations (cost=0.00..17.00 rows=1000 width=24) (actual time=0.008..1.216 rows=1000 loops=1)
7.	0.298	0.621	↑ 1.0	200	1	→ Hash (cost=10.00..10.00 rows=200 width=12) (actual time=0.621..0.621 rows=200 loops=1) Buckets: 1024 Batches: 1 Memory Usage: 9kB
8.	0.323	0.323	↑ 1.0	200	1	→ Seq Scan on goodsoperations (cost=0.00..10.00 rows=200 width=12) (actual time=0.008..0.323 rows=200 loops=1)

                                                                 QUERY PLAN                                                                  
--------------------------------------------------------------------------------------------------------------------------------------------- 
 Sort  (cost=79.14..79.64 rows=200 width=125) (actual time=6.775..6.971 rows=200 loops=1) 
   Sort Key: financeoperations.date 
   Sort Method: quicksort  Memory: 78kB 
   ->  Hash Join  (cost=37.75..71.50 rows=200 width=125) (actual time=3.766..6.380 rows=200 loops=1) 
         Hash Cond: (partners.id = financeoperations.partner_id) 
         ->  Seq Scan on partners  (cost=0.00..28.00 rows=1000 width=105) (actual time=0.009..1.180 rows=1000 loops=1) 
         ->  Hash  (cost=35.25..35.25 rows=200 width=28) (actual time=3.684..3.684 rows=200 loops=1) 
               Buckets: 1024  Batches: 1  Memory Usage: 12kB 
               ->  Hash Join  (cost=12.50..35.25 rows=200 width=28) (actual time=0.656..3.377 rows=200 loops=1) 
                     Hash Cond: (financeoperations.goodsoperation_id = goodsoperations.id) 
                     ->  Seq Scan on financeoperations  (cost=0.00..17.00 rows=1000 width=24) (actual time=0.008..1.216 rows=1000 loops=1) 
                     ->  Hash  (cost=10.00..10.00 rows=200 width=12) (actual time=0.621..0.621 rows=200 loops=1) 
                           Buckets: 1024  Batches: 1  Memory Usage: 9kB 
                           ->  Seq Scan on goodsoperations  (cost=0.00..10.00 rows=200 width=12) (actual time=0.008..0.323 rows=200 loops=1) 
 Total runtime: 7.241 ms

Per node type stats

node type	count	sum of times	% of query
Hash	2	0.605 ms	8.7 %
Hash Join	2	3.056 ms	43.8 %
Seq Scan	3	2.719 ms	39.0 %
Sort	1	0.591 ms	8.5 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
financeoperations	1	1.216 ms	17.4 %
Seq Scan	1	1.216 ms	100.0 %
goodsoperations	1	0.323 ms	4.6 %
Seq Scan	1	0.323 ms	100.0 %
partners	1	1.180 ms	16.9 %
Seq Scan	1	1.180 ms	100.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: Uod

Colorize:

Columns visibility:

Per node type stats

Per table stats