Op maandag 16 november 2009 19:09:52 schreef J. Delgado:
> On Mon, Nov 16, 2009 at 9:44 AM, Earwin Burrfoot wrote:
> > This algo is strictly tied to sort-by-score, if I understand it correctly.
> > Lucene has queries and sorting decoupled (except for allowOutOfOrder
> > mess), so implementing it w
On Mon, Nov 16, 2009 at 9:44 AM, Earwin Burrfoot wrote:
> This algo is strictly tied to sort-by-score, if I understand it correctly.
> Lucene has queries and sorting decoupled (except for allowOutOfOrder
> mess), so implementing it would require some really fat hacks.
>
According to the paper on
This algo is strictly tied to sort-by-score, if I understand it correctly.
Lucene has queries and sorting decoupled (except for allowOutOfOrder
mess), so implementing it would require some really fat hacks.
On Mon, Nov 16, 2009 at 20:26, J. Delgado wrote:
> As I understood it setMinimumNumberShou
As I understood it setMinimumNumberShouldMatch(int min) Is used to
specify a minimum number of the optional BooleanClauses which must be
satisfied.
I haven't seen the implementation of setMinimumNumberShouldMatch but
it seems a bit different than what is intended with the WAND operator,
which can
in Shekhar Mangar [mailto:shalinman...@gmail.com]
> *Sent:* Monday, November 16, 2009 8:13 AM
> *To:* solr-...@lucene.apache.org
> *Cc:* java-dev@lucene.apache.org
> *Subject:* Re: Efficient Query Evaluation using a Two-Level Retrieval
> Process
>
>
>
> Hey Joaquin,
>
>
Cc: java-dev@lucene.apache.org
Subject: Re: Efficient Query Evaluation using a Two-Level Retrieval Process
Hey Joaquin,
The mailing list strips off attachments. Can you please upload it somewhere
and give us the link?
On Mon, Nov 16, 2009 at 12:35 PM, J. Delgado
wrote:
Please find
Hey Joaquin,
The mailing list strips off attachments. Can you please upload it somewhere
and give us the link?
On Mon, Nov 16, 2009 at 12:35 PM, J. Delgado wrote:
> Please find attached the paper on "Efficient Query Evaluation using a
> Two-Level Retrieval Process". I believe that such approach
