lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Andrzej Bialecki ...@getopt.org>
Subject Re: Combining search steps without re-searching
Date Mon, 28 Aug 2006 19:19:34 GMT
Chuck Williams wrote:
> I presume your search steps are anded, as in typical drill-downs?
>
> >From  a Lucene standpoint, each sequence of steps is a BooleanQuery of
> required clauses, one for each step.  To add a step, you extend the
> BooleanQuery with a new clause.  To not re-evaluate the full query,
>   

... umm, guys, wouldn't a series of QueryFilter's work much better in 
this case? If some of the clauses are repeatable, then filtering results 
through a cached BitSet in such filtered query would work nicely, right?

-- 
Best regards,
Andrzej Bialecki     <><
 ___. ___ ___ ___ _ _   __________________________________
[__ || __|__/|__||\/|  Information Retrieval, Semantic Web
___|||__||  \|  ||  |  Embedded Unix, System Integration
http://www.sigram.com  Contact: info at sigram dot com



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


Mime
View raw message