I'm using disjunction (OR) query. unfortunately all of the clauses are
optional
On Sat, May 26, 2012 at 4:38 AM, Simon Willnauer <
simon.willna...@googlemail.com> wrote:
> On Sat, May 26, 2012 at 2:59 AM, Yang wrote:
> > I tested with more threads / processes. indeed this is completely
> > cpu-b
if you don't score but sort by id, it may be a little bit faster. but
for 3.x, you can hardly speed up by simpler scoring function. for your
situation, the bottleneck is cpu. you can speed up by paralleling. so
the best one is to split index and searching concurrently. so the cpus
can be fully used
On Sat, May 26, 2012 at 2:59 AM, Yang wrote:
> I tested with more threads / processes. indeed this is completely
> cpu-bound, since running 1 thread gives the same latency as 4 threads (my
> box has 4 cores)
>
>
> given this, is there any way to simplify the scoring computation (i'm only
> using l
