Hi Mike and Uwe,
Thank you for your answers. It is clear, now.
Regards,
Aurélien
On 10.10.2014 12:32, Uwe Schindler wrote:
Hi,
every segment is executed on its own (every segment is its own index).
Every segment returns its own document ids and the result is the union
of them ranked by score using a PriorityQueue. There is no
cross-segment term dictionary and posting lists in Lucene. It was like
that before Lucene 2.9, but this is no longer the case - every segment
is handled on its own.
Uwe
-----
Uwe Schindler
H.-H.-Meier-Allee 63, D-28213 Bremen
http://www.thetaphi.de
eMail: u...@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 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: java-user-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-user-h...@lucene.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-user-h...@lucene.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-user-h...@lucene.apache.org
