lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF subversion and git services (JIRA)" <>
Subject [jira] [Commented] (LUCENE-8922) Speed up retrieval of top hits of DisjunctionMaxQuery
Date Wed, 24 Jul 2019 14:22:00 GMT


ASF subversion and git services commented on LUCENE-8922:

Commit 8df37aaf2c55b5d8927eb380e7fd3cffb7224a80 in lucene-solr's branch refs/heads/branch_8x
from Adrien Grand
[;h=8df37aa ]

LUCENE-8922: 8.x adjustments.

> Speed up retrieval of top hits of DisjunctionMaxQuery
> -----------------------------------------------------
>                 Key: LUCENE-8922
>                 URL:
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Adrien Grand
>            Priority: Minor
>          Time Spent: 20m
>  Remaining Estimate: 0h
> There a simple optimization that we are not doing in the case that tieBreakMultiplier
is 0: we could propagate the min competitive score to sub clauses as-is.
> Even in the general case, we currently compute the block boundary of the DisjunctionMaxQuery
as the minimum of the block boundaries of its sub clauses. This generates blocks that have
very low score upper bounds but unfortunately they are also very small, which means that we
might sometimes not make progress quickly enough.

This message was sent by Atlassian JIRA

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message