Skip to content

Instantly share code, notes, and snippets.

@midhunkrishna

midhunkrishna/explain.txt

Created April 26, 2018 19:15
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save midhunkrishna/65bd40c08ebde9f6f31c6ecb6c3f6407 to your computer and use it in GitHub Desktop.
Save midhunkrishna/65bd40c08ebde9f6f31c6ecb6c3f6407 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
explain.txt
QUERY PLAN
--------------------------------------------------------------------------------
--------------------------------------------------------------------------------
-------------------------------------------------------
Limit (cost=8558.43..8558.48 rows=20 width=20)
-> Sort (cost=8558.43..8563.87 rows=2175 width=20)
Sort Key: (CASE WHEN ((importance = '0'::double precision) OR (importan
ce IS NULL)) THEN ('0.75001'::double precision - ((search_rank)::double precisio
n / '40'::double precision)) ELSE importance END) DESC
-> Bitmap Heap Scan on search_name (cost=44.86..8500.55 rows=2175 wid
th=20)
Recheck Cond: (name_vector @> '{5639492}'::integer[])
-> Bitmap Index Scan on idx_search_name_name_vector (cost=0.00.
.44.32 rows=2175 width=0)
Index Cond: (name_vector @> '{5639492}'::integer[])
(7 rows)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment