Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm
Precedence: bulk
Reply-To: java-user@lucene.apache.org
Received-SPF: neutral (nike.apache.org: local policy)
MIME-Version: 1.0
In-Reply-To: <28a2971e14526f40f7e30d3559836c57@francelabs.com>
References: <28a2971e14526f40f7e30d3559836c57@francelabs.com>
From: Michael McCandless <lucene@mikemccandless.com>
Date: Fri, 10 Oct 2014 06:18:03 -0400
Message-ID: 
 <CAL8PwkbFjeDxHU4ujg++10QcAyFUWbV9jMyeqyaBG1o6tk=Tmg@mail.gmail.com>
Subject: Re: Search with term intersection
To: Lucene Users <java-user@lucene.apache.org>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

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

http://blog.mikemccandless.com


On Fri, Oct 10, 2014 at 5:02 AM,  <aurelien.mazoyer@francelabs.com> 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 t=
han
> one segment? I suppose that skip-list cannot be used anymore. Which data
> structure is used? Bitset?
>
> Thank you for your answer.
>
> Aur=C3=A9lien
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
> For additional commands, e-mail: java-user-help@lucene.apache.org
>

---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org