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, 2
Points cannot sort. They can only do range queries.
So you need to convert your 128 bit BigInts into a
sort-order-preserving byte[] (BigIntegerPoint.encodeDimension should
do this correctly), and then index that byte[] using a
SortedDocValuesField.
Mike McCandless
http://blog.mikemccandless.com
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 :
> My guess is that you n
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.lorenze...@gmail.com> wrote:
> How it is possible to search in a bitmask for soddisfying a request as
>
> bitmask&0xf == 0xf ?
>
--
Sincer
I think to sort properly you must also ensure all byte[] from those
BigIntegers are the same length, and that you sign extend them?
Mike McCandless
http://blog.mikemccandless.com
On Sun, Aug 21, 2016 at 5:50 AM, Cristian Lorenzetto
wrote:
> I took a look for bigInteger point but i didnt see no
