[ https://issues.apache.org/jira/browse/LUCENE-6276?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Paul Elschot updated LUCENE-6276: --------------------------------- Attachment: LUCENE-6276.patch Patch of 27 October 2015. This - is against trunk of today, - resolves the conflicts from Spans becoming a Scorer, - changes the matchCost to be an estimate of the number of operations needed for the positions. This uses a cost of 7 per position as in the codec code, and a basic cost 128 (no more than a guess) for the initial seek and refill. - adds a few more implementations to make ant compile-test pass at top level. Since 7 is rather low and the expected number of positions per document containing the term is just above 1 in many cases, I left matchCost() returning a float. > Add matchCost() api to TwoPhaseDocIdSetIterator > ----------------------------------------------- > > Key: LUCENE-6276 > URL: https://issues.apache.org/jira/browse/LUCENE-6276 > Project: Lucene - Core > Issue Type: Improvement > Reporter: Robert Muir > Attachments: LUCENE-6276-ExactPhraseOnly.patch, > LUCENE-6276-NoSpans.patch, LUCENE-6276-NoSpans2.patch, LUCENE-6276.patch, > LUCENE-6276.patch, LUCENE-6276.patch, LUCENE-6276.patch, LUCENE-6276.patch > > > We could add a method like TwoPhaseDISI.matchCost() defined as something like > estimate of nanoseconds or similar. > ConjunctionScorer could use this method to sort its 'twoPhaseIterators' array > so that cheaper ones are called first. Today it has no idea if one scorer is > a simple phrase scorer on a short field vs another that might do some geo > calculation or more expensive stuff. > PhraseScorers could implement this based on index statistics (e.g. > totalTermFreq/maxDoc) -- This message was sent by Atlassian JIRA (v6.3.4#6332) --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org For additional commands, e-mail: dev-h...@lucene.apache.org