explain.depesz.com

PostgreSQL's explain analyze made readable

Result: DQUQ

Settings
# exclusive inclusive rows x rows loops node
1. 0.001 8.217 ↑ 1.0 10 1

Limit (cost=47.51..75.05 rows=10 width=291) (actual time=8.200..8.217 rows=10 loops=1)

  • Output: task_search.id, task_search.task_id, task_search.search_type, task_search.client_id, task_search.archived, task_search.document, task_search.document_vector, query.query
  • Buffers: shared hit=23
2. 0.010 8.216 ↑ 303.3 10 1

Nested Loop (cost=47.51..8,402.15 rows=3,033 width=291) (actual time=8.199..8.216 rows=10 loops=1)

  • Output: task_search.id, task_search.task_id, task_search.search_type, task_search.client_id, task_search.archived, task_search.document, task_search.document_vector, query.query
  • Buffers: shared hit=23
3. 0.004 0.004 ↑ 1.0 1 1

Function Scan on query (cost=0.00..0.01 rows=1 width=32) (actual time=0.004..0.004 rows=1 loops=1)

  • Output: query.query
  • Function Call: '''0'':*'::tsquery
4. 1.214 8.202 ↑ 303.3 10 1

Bitmap Heap Scan on public.task_search (cost=47.51..8,371.81 rows=3,033 width=259) (actual time=8.190..8.202 rows=10 loops=1)

  • Output: task_search.id, task_search.task_id, task_search.search_type, task_search.client_id, task_search.archived, task_search.document, task_search.document_vector
  • Recheck Cond: (task_search.document_vector @@ query.query)
  • Heap Blocks: exact=9
  • Buffers: shared hit=23
5. 6.988 6.988 ↓ 4.0 12,252 1

Bitmap Index Scan on task_search_document_vector_idx (cost=0.00..46.75 rows=3,033 width=0) (actual time=6.988..6.988 rows=12,252 loops=1)

  • Index Cond: (task_search.document_vector @@ query.query)
  • Buffers: shared hit=14
Planning time : 0.493 ms
Execution time : 8.264 ms