...@thetaphi.de
-Original Message-
From: aurelien.mazo...@francelabs.com
[mailto:aurelien.mazo...@francelabs.com]
Sent: Friday, October 10, 2014 11:03 AM
To: java-user@lucene.apache.org
Subject: Search with term intersection
Hi,
I know that Lucene uses a skip-list algorithm to search very
elabs.com]
> Sent: Friday, October 10, 2014 11:03 AM
> To: java-user@lucene.apache.org
> Subject: Search with term intersection
>
> Hi,
>
> I know that Lucene uses a skip-list algorithm to search very fast even if the
> query needs to calculate intersection between t
By intersection, do you mean a MUST clause on a BooleanQuery?
Lucene uses "doc at a time" scoring, so for BooleanQuery, all MUST'd
clauses are visiting the same doc (if they match) at a time, so we do
the intersection for that document all at once, within each segment,
across the N clauses.
Mike
Hi,
I know that Lucene uses a skip-list algorithm to search very fast even
if the query needs to calculate intersection between terms within a
segment. But what happened if it needs to calculate an intersection
between more than one segment? I suppose that skip-list cannot be used
anymore. Wh
