lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From will martin <wmartin...@gmail.com>
Subject Re: Searching in a bitMask
Date Sun, 28 Aug 2016 05:05:30 GMT
hi

aren’t we waltzing terribly close to the use of a bit vector in your field caches?
there’s no reason to not filter longword operations on a cache if alignment is consistent
across multiple caches

just be sure to abstract your operations away from individual bits….imo



-will

> On Aug 27, 2016, at 2:30 PM, Cristian Lorenzetto <cristian.lorenzetto@gmail.com>
wrote:
> 
> Yes thinking a bit more about my question , i understood to make a query to
> process every document will be not a good solution. I preferred to use
> boolean properties with traditional inverted index.  Thanks for
> confirmation :)
> 
> 2016-08-27 20:24 GMT+02:00 Mikhail Khludnev <mkhl@apache.org>:
> 
>> My guess is that you need to implement own MultyTermQuery, and I guess it's
>> gonna be slow.
>> 
>> On Sat, Aug 27, 2016 at 8:41 AM, Cristian Lorenzetto <
>> cristian.lorenzetto@gmail.com> wrote:
>> 
>>> How it is possible to search in a bitmask for soddisfying a request as
>>> 
>>> bitmask&0xf == 0xf ?
>>> 
>> 
>> 
>> 
>> --
>> Sincerely yours
>> Mikhail Khludnev
>> 


---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org


Mime
View raw message