Hi Adrien,
Please correct if I am wrong, but I believe using extended IntComparator in
custom Sort object for randomization would still score documents (using
IndexSearcher.search(Query, int, Sort), for example).
So I tried using a custom collector using IndexSearcher.search(Query,
Collector)
Yes, this collector won't perform well if you have many matches since
memory usage is linear with the number of matches. A better option would be
to extend eg. IntComparator and implement getNumericDocValues by returning
a fake NumericDocValues instance that eg. does a bit mix of the doc id and
a p
Hi Adrien,
Thanks for your reply.
I have also tried testing with UsageTrackingQueryCachingPolicy, but did not
observe a significant change in both latency and throughput.
Given that I have specific search requirements of no scoring and sorting the
search results in a random order (reason for c
