Andy Colson <a...@squeakycode.net> writes:
> -> Bitmap Index Scan on search_key (cost=0.00..6.00 rows=1 width=0)
> (actual time=0.025..0.025 rows=0 loops=1)
> Index Cond: (search_vec @@ to_tsquery('213 & E & 13 & ST &
> N'::text))
Hmm ... so the partial case actually is significantly more expensive than
the non-partial case: 4 msec vs .025 msec. Still, that's about a 200x
penalty, not the 10000x penalty the planner is ascribing to it.
Thanks for the data! I'll go moan about this on -hackers.
regards, tom lane
--
Sent via pgsql-general mailing list (pgsql-general@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-general
