The PrefixQuery allows an application to identify all documents Implementation, it is essentially a special case of the WildcardQuery. Of the numeric fields ( IntPoint, LongPoint, FloatPoint, or DoublePoint). For PointRangeQuery to work, you must index the values using a one The PointRangeQuery matches all documents ForĮxample, this can be used to perform phrase queries that also incorporate synonyms. General form of PhraseQuery that accepts multiple Terms for a position in the phrase.

Terms in the phrase and still be considered a match. PhraseQuery uses a slop factor to determine how many positions may occur between any two Of clauses is 1024, but this can be changed via the static method tMaxClauseCount(int).Īnother common search is to find documents containing certain phrases. The default setting for the maximum number TermQuery clauses, for example by WildcardQuery. This most often occurs when a Query is rewritten into a BooleanQuery with many No document in the result set willīoolean queries are constructed by adding two or more BooleanClause instances. Operator when a clause must not occur in the result set. Every document in the result set will match all such clauses. Operator when a clause is required to occur in the result set but should not contribute to When a clause is required to occur in the result set and should contribute to the score.Įvery document in the result set will match all such clauses. Up of all SHOULD clauses, then every document in the result set matches at least one of Operator when a clause can occur in the result set, but is not required. ( Query instance) and an operator (from BooleanClause.Occur) describing how that sub-query A BooleanQuery contains multiple BooleanClauses, where each clause contains a sub-query Things start to get interesting when one combines multiple TermQuery instances into a BooleanQuery. In this example, the Query identifies all Documents that have the Field named 'fieldName' containing the word TermQuery tq = new TermQuery(new Term('fieldName', 'term')) Constructing a TermQuery is as simple as: Thus, a TermQuery identifies and scores all Documents that have a Field with the specified string in it. A TermQuery matches all theĭocuments that contain the specified Term, which is a word Of the various implementations of Query, the TermQuery is the easiest to understand and the most often See the Algorithm section for more notes on the process. Infrastructure setup, control finally passes to the Weight implementation and its Scorer or BulkScorer instances.

Once a Query has been created and submitted to the IndexSearcher, the scoring process begins. To perform a search, applications usually call arch(Query,int). For details on implementing your own Query class, see Custom Queries - Expert Level below. The Query Classes section below highlights some of the more Querying capabilities along with information about where matches took place in the documentĬollection. These implementations can be combined in a wide variety of ways to provide complex Of which are in this package or the queries Lucene offers a wide variety of Query implementations, most

Appendix: Search Algorithm Search Basics.

Apache lucene search example