#	rows x	node
1.	↓ 0.0	→ Sort (cost=11088.51..11088.54 rows=10 width=1121) (actual time=.. rows= loops=) Sort Key: meeting_topics.due_date
2.	↓ 0.0	→ Hash Join (cost=1441.03..11088.35 rows=10 width=1121) (actual time=.. rows= loops=) Hash Cond: (meeting_topics.meeting_id = meetings.id)
3.	↓ 0.0	→ Seq Scan on meeting_topics (cost=0.00..9529.91 rows=31283 width=480) (actual time=.. rows= loops=) Filter: ((current_topic IS TRUE) AND (deleted_at IS NULL) AND (status = 'Open'::text))
4.	↓ 0.0	→ Hash (cost=1440.95..1440.95 rows=6 width=641) (actual time=.. rows= loops=)
5.	↓ 0.0	→ Seq Scan on meetings (cost=0.00..1440.95 rows=6 width=641) (actual time=.. rows= loops=) Filter: ((NOT is_draft) AND (project_id = 55))

Sort  (cost=11088.51..11088.54 rows=10 width=1121)"
  Sort Key: meeting_topics.due_date"
  ->  Hash Join  (cost=1441.03..11088.35 rows=10 width=1121)"
        Hash Cond: (meeting_topics.meeting_id = meetings.id)"
        ->  Seq Scan on meeting_topics  (cost=0.00..9529.91 rows=31283 width=480)"
              Filter: ((current_topic IS TRUE) AND (deleted_at IS NULL) AND (status = 'Open'::text))"
        ->  Hash  (cost=1440.95..1440.95 rows=6 width=641)"
              ->  Seq Scan on meetings  (cost=0.00..1440.95 rows=6 width=641)"
                    Filter: ((NOT is_draft) AND (project_id = 55))"

Per node type stats

node type	count	sum of times	% of query
Hash	1	0.000 ms	0.0 %
Hash Join	1	0.000 ms	0.0 %
Seq Scan	2	0.000 ms	0.0 %
Sort	1	0.000 ms	0.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
meeting_topics	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
meetings	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %

explain.depesz.com

A tool for finding a real cause for slow queries.

Result: JFB

Colorize:

Columns visibility:

Per node type stats

Per table stats