I've been looking at the BooleanScorer code in 1.4.3 and realized that it has several problems. These are:
1) It does things in chunks of 1024 document ids. This means it executes in a time that depends on the number of indexed documents.
2) Finding the subscorer with the lowest document id sc
The following code in the TermWeight subclass of TermQuery seems inconsistent:
public float sumOfSquaredWeights() throws IOException {
idf = getSimilarity(searcher).idf(term, searcher); // compute idf
queryWeight = idf * getBoost(); // compute query weight
return
umber of indexed documents.
Karl
Paul Elschot <[EMAIL PROTECTED]> wrote:
On Sunday 22 May 2005 03:09, Karl Wright wrote:
> I've been looking at the BooleanScorer code in 1.4.3 and realized that it
has several problems. These are:
>
> 1) It does things in chunks of 1024 do
,
ReqOptScorer, etc.
Karl
Paul Elschot <[EMAIL PROTECTED]> wrote:
On Sunday 22 May 2005 03:09, Karl Wright wrote:
> I've been looking at the BooleanScorer code in 1.4.3 and realized that it
has several problems. These are:
>
> 1) It does things in chunks of 1024 documen
