Re: scoring differences between bitmasks - Mailing list pgsql-general

From Ben
Subject Re: scoring differences between bitmasks
Date
Msg-id E609BD70-26A2-472B-9B6D-DE2462C39C1E@silentmedia.com
Whole thread Raw
In response to scoring differences between bitmasks  (Ben <bench@silentmedia.com>)
Responses Re: scoring differences between bitmasks  ("Todd A. Cook" <tcook@blackducksoftware.com>)
List pgsql-general
Sure, but unless I can figure out some way to choose a small number
of vectors, I'm left with computing the full N^2 set. Given that I'm
shooting for N to be 4 million or larger, that's a lot of data to
store.....

On Oct 2, 2005, at 12:14 PM, Todd A. Cook wrote:

> Ben wrote:
>
>> Just the number of bits, not which ones. Basically, the hamming
>> distance.
>>
>
> I see.  Could you pre-compute the bit counts for the vectors in the
> table?
> You could count the bits in the search vector as Martijn suggested,
> and then
> do a lookup based on the count.
>
> -- todd
>
>
>
>


pgsql-general by date:

Previous
From: Wes
Date:
Subject: Re: 8.1 'make check' fails
Next
From: Samik Raychaudhuri
Date:
Subject: Re: Portable PostgreSQL