Class 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.
Inherited Members
Namespace:
Assembly: Lucene.Net.NetCore.dll
Syntax
public class DisjunctionMaxQuery : Query, Collections.Generic.IEnumerable<Query>, ICloneableConstructors
| Name | Description |
|---|---|
| DisjunctionMaxQuery(Collections.Generic.ICollection<Query>, Single) | Creates a new DisjunctionMaxQuery |
|
Disjunction |
Creates a new empty DisjunctionMaxQuery. Use add() to add the subqueries. |
Methods
| Name | Description |
|---|---|
| Add(Query) | Add a subquery to this disjunction |
| Add(Collections.Generic.ICollection<Query>) | Add a collection of disjuncts to this disjunction via Iterable |
| Clone() | Create a shallow copy of us -- used in rewriting if necessary |
|
Create |
|
| Equals(Object) | Return true iff we represent the same query as o |
| ExtractTerms(Collections.Generic.ISet<Term>) | |
|
Get |
An Iterator<Query> over the disjuncts |
|
Get |
Compute a hash code for hashing us |
|
Rewrite(Index |
Optimize our representation and our subqueries representations |
|
To |
Prettyprint us. |