On Thu, Jan 07, 2010 at 01:03:27PM -0500, Ryan McKinley wrote: > Perhaps each segment has its own r-tree. For each query, the r-tree would > only be used to say if something could be in the results, it does not > contribute to the score, so I don't think interleaving would be any > different then how it currently works (without knowing how it currently > works) Potentially, the node depth could influence the score, but lets > ignore that for now :)
Yes, if the results of the r-tree search are only for filtering, it wouldn't matter. If they are used to contribute to a score, interleaving is also easy, because you just compare scores and the higher score wins. It's only important if you wanted to, say, sort by distance. Marvin Humphrey --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
