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
