lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Michael McCandless <>
Subject Re: Search with term intersection
Date Fri, 10 Oct 2014 10:18:03 GMT
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 McCandless

On Fri, Oct 10, 2014 at 5:02 AM,  <> wrote:
> 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. Which data
> structure is used? Bitset?
> Thank you for your answer.
> Aurélien
> ---------------------------------------------------------------------
> To unsubscribe, e-mail:
> For additional commands, e-mail:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message