On 12/30/2015 9:55 AM, Andy Colson wrote:
> On 12/30/2015 9:53 AM, Tom Lane wrote:
>> Andy Colson <andy@squeakycode.net> writes:
>>> Here are my results, if there are any others you'd like to see please
>>> let me know. Thanks Tom.
>>
>> For comparison, could we see the results for the non-partial case, ie
>>
>> explain analyze
>> select *
>> from search
>> where search_vec @@ to_tsquery('213 & E & 13 & ST & N');
>>
>> regards, tom lane
>>
>
> QUERY PLAN
> -------------------------------------------------------------------------------------------------------------------
>
> Bitmap Heap Scan on search (cost=6.00..7.02 rows=1 width=100) (actual
> time=0.029..0.029 rows=0 loops=1)
> Recheck Cond: (search_vec @@ to_tsquery('213 & E & 13 & ST & N'::text))
> -> 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))
> Total runtime: 0.060 ms
> (5 rows)
>
>
>
>
Oh! I just realized... this is on my test box and I just blew away that
table to rebuild it. And I have to run off to a meeting, so if this
analyze makes no sense, that's why.
I'll re-re-do it within the hour. Sorry about that.
-Andy
