compression did a lot of good, but there is one set of use cases where we have
significant speed loss when using defaults.
There is lovely concept of Document Values that is perfect for smallish single
fields, there are also stored fields that are prefect for clunky texts, but
there is a ga
Uwe,
I think Mathias was talking about the case with many smallish fields that all
get read per document. DV approach would mean seeking N times, while stored
fields, only once? Or you meant he should encode all his fields into single
byte[]?
Or did I get it all wrong about stored vs DV :)
ecisionStep is infinite, as
> those fields contain additional terms with lower precision.
>
> Uwe
>
> -
> Uwe Schindler
> H.-H.-Meier-Allee 63, D-28213 Bremen
> http://www.thetaphi.de
> eMail: u...@thetaphi.de
>
>
>> -Original Message-
>> From:
should't there be a way to do it efficiently for any indexed field (even max
in byte order)? Term dict is sorted
On May 17, 2013, at 12:08 PM, "Uwe Schindler" wrote:
> Hi,
>
> Depending on the distinct number of actual values, it might be better to
> iterate over the term dictionary and
