Adrien Grand created LUCENE-8922:
------------------------------------
Summary: Speed up retrieval of top hits of DisjunctionMaxQuery
Key: LUCENE-8922
URL: https://issues.apache.org/jira/browse/LUCENE-8922
Project: Lucene - Core
Issue Type: Improvement
Reporter: Adrien Grand
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
(v7.6.14#76016)
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
