Package org.apache.lucene.search
Class DisjunctionMaxQuery
java.lang.Object
org.apache.lucene.search.Query
org.apache.lucene.search.DisjunctionMaxQuery
A query that generates the union of documents produced by its subqueries, and that scores each
document with the maximum score for that document as produced by any subquery, plus a tie
breaking increment for any additional matching subqueries. This is useful when searching for a
word in multiple fields with different boost factors (so that the fields cannot be combined
equivalently into a single search field). We want the primary score to be the one associated with
the highest boost, not the sum of the field scores (as BooleanQuery would give). If the query is
"albino elephant" this ensures that "albino" matching one field and "elephant" matching another
gets a higher score than "albino" matching both fields. To get this result, use both BooleanQuery
and DisjunctionMaxQuery: for each term a DisjunctionMaxQuery searches for it in each field, while
the set of these DisjunctionMaxQuery's is combined into a BooleanQuery. The tie breaker
capability allows results that include the same term in multiple fields to be judged better than
results that include this term in only the best of those multiple fields, without confusing this
with the better case of two different terms in the multiple fields.
-
Nested Class Summary
Modifier and TypeClassDescriptionprotected class
Expert: the Weight for DisjunctionMaxQuery, used to normalize, score and explain these queries. -
Constructor Summary
ConstructorDescriptionDisjunctionMaxQuery
(Collection<Query> disjuncts, float tieBreakerMultiplier) Creates a new DisjunctionMaxQuery -
Method Summary
Modifier and TypeMethodDescriptioncreateWeight
(IndexSearcher searcher, ScoreMode scoreMode, float boost) Create the Weight used to score usboolean
Return true if we represent the same query as otherfloat
int
hashCode()
Compute a hash code for hashing usiterator()
rewrite
(IndexReader reader) Optimize our representation and our subqueries representationsPrettyprint us.void
visit
(QueryVisitor visitor) Recurse through the query tree, visiting any child queriesMethods inherited from class org.apache.lucene.search.Query
classHash, sameClassAs, toString
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Constructor Details
-
DisjunctionMaxQuery
Creates a new DisjunctionMaxQuery- Parameters:
disjuncts
- aCollection<Query>
of all the disjuncts to addtieBreakerMultiplier
- the score of each non-maximum disjunct for a document is multiplied by this weight and added into the final score. If non-zero, the value should be small, on the order of 0.1, which says that 10 occurrences of word in a lower-scored field that is also in a higher scored field is just as good as a unique word in the lower scored field (i.e., one that is not in any higher scored field.
-
-
Method Details
-
iterator
-
getDisjuncts
- Returns:
- the disjuncts.
-
getTieBreakerMultiplier
public float getTieBreakerMultiplier()- Returns:
- tie breaker value for multiple matches.
-
createWeight
public Weight createWeight(IndexSearcher searcher, ScoreMode scoreMode, float boost) throws IOException Create the Weight used to score us- Overrides:
createWeight
in classQuery
scoreMode
- How the produced scorers will be consumed.boost
- The boost that is propagated by the parent queries.- Throws:
IOException
-
rewrite
Optimize our representation and our subqueries representations- Overrides:
rewrite
in classQuery
- Parameters:
reader
- the IndexReader we query- Returns:
- an optimized copy of us (which may not be a copy if there is nothing to optimize)
- Throws:
IOException
-
visit
Description copied from class:Query
Recurse through the query tree, visiting any child queries -
toString
Prettyprint us. -
equals
Return true if we represent the same query as other -
hashCode
public int hashCode()Compute a hash code for hashing us
-