Code to search indices.

Interface Summary

FieldCache Expert: Maintains caches of term values.
FieldCache.ByteParserInterface to parse bytes from document fields.
FieldCache.FloatParserInterface to parse floats from document fields.
FieldCache.IntParserInterface to parse ints from document fields.
FieldCache.ShortParserInterface to parse shorts from document fields.
ScoreDocComparator Expert: Compares two ScoreDoc objects for sorting.
SearchableThe interface for search implementations.
SortComparatorSource Expert: returns a comparator for sorting ScoreDocs.
WeightExpert: Calculate query weights and build query scorers.

Class Summary

BooleanClauseA clause in a BooleanQuery.
BooleanClause.OccurSpecifies how clauses are to occur in matching documents.
BooleanFilter A container Filter that allows Boolean composition of Filters.
BooleanQueryA Query that matches documents matching boolean combinations of other queries, e.g.
BoostingQuery The BoostingQuery class can be used to effectively demote results that match a given query.
CachingSpanFilter Wraps another SpanFilter's result and caches it.
CachingWrapperFilter Wraps another filter's result and caches it.
ComplexExplanationExpert: Describes the score computation for document and query, andcan distinguish a match independent of a positive value.
ConstantScoreQuery A query that wraps a filter and simply returns a constant score equal to the query boost for every document in the filter.
ConstantScoreRangeQuery A range query that returns a constant score equal to its boost for all documents in the range.
DefaultSimilarityExpert: Default scoring implementation.
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.
DuplicateFilter Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements.
ExplanationExpert: Describes the score computation for document and query.
FieldCache.StringIndexExpert: Stores term text values and document ordering data.
FieldDoc Expert: A ScoreDoc which also contains information about how to sort the referenced document.
FieldSortedHitQueue Expert: A hit queue for sorting by hits by terms in more than one field.
FilterAbstract base class providing a mechanism to restrict searches to a subset of an index.
FilterClause A Filter that wrapped with an indication of how that filter is used when composed with another filter.
FilteredQuery A query that applies a filter to the results of another query.
FilteredTermEnumAbstract class for enumerating a subset of all terms.
FilterManager Filter caching singleton.
FilterManager.FilterCleaner Keeps the cache from getting too big.
FilterManager.FilterItem Holds the filter and the last time the filter was used, to make LRU-based cache cleaning possible.
FuzzyLikeThisQuery Fuzzifies ALL terms provided as strings and then picks the best n differentiating terms.
FuzzyQueryImplements the fuzzy search query.
FuzzyTermEnumSubclass of FilteredTermEnum for enumerating all terms that are similiar to the specified filter term.
Hit Wrapper used by HitIterator to provide a lazily loaded hit from Hits.
HitCollectorLower-level search API.
HitIterator An iterator over Hits that provides lazy fetching of each document.
HitsA ranked list of documents, used to hold search results.
IndexSearcherImplements search over a single IndexReader.
MatchAllDocsQuery A query that matches all documents.
MultiPhraseQuery MultiPhraseQuery is a generalized version of PhraseQuery, with an added method add(Term[]).
MultiSearcherImplements search over a set of Searchables.
MultiTermQuery A Query that matches documents containing a subset of terms provided by a FilteredTermEnum enumeration.
ParallelMultiSearcherImplements parallel search over a set of Searchables.
PhraseQueryA Query that matches documents containing a particular sequence of terms.
PrefixQueryA Query that matches documents containing terms with a specified prefix.
QueryThe abstract base class for queries.
QueryFilterConstrains search results to only match those which also match a provided query.
QueryWrapperFilter Constrains search results to only match those which also match a provided query.
RangeFilter A Filter that restricts search results to a range of values in a given field.
RangeQuery A Query that matches documents within an exclusive range.
RemoteCachingWrapperFilter Provides caching of Filters themselves on the remote end of an RMI connection.
RemoteSearchable A remote searchable implementation.
ReqExclScorerA Scorer for queries with a required subscorer and an excluding (prohibited) subscorer.
ReqOptSumScorerA Scorer for queries with a required part and an optional part.
ScoreDocExpert: Returned by low-level search implementations.
Scorer Expert: Common scoring functionality for different types of queries.
SearcherAn abstract base class for search implementations.
SimilarityExpert: Scoring API.
SimilarityDelegatorExpert: Delegating scoring implementation.
Sort Encapsulates sort criteria for returned hits.
SortComparator Abstract base class for sorting hits returned by a Query.
SortField Stores information about how to sort documents by terms in an individual field.
SpanFilterAbstract base class providing a mechanism to restrict searches to a subset of an index and also maintains and returns position information.
SpanFilterResult The results of a SpanQueryFilter.
SpanQueryFilter Constrains search results to only match those which also match a provided query.
TermQueryA Query that matches documents containing a term.
TermsFilter Constructs a filter for docs matching any of the terms added to this class.
TopDocCollectorA HitCollector implementation that collects the top-scoring documents, returning them as a TopDocs.
TopDocsExpert: Returned by low-level search implementations.
TopFieldDocCollectorA HitCollector implementation that collects the top-sorting documents, returning them as a TopFieldDocs.
TopFieldDocs Expert: Returned by low-level sorted search implementations.
WildcardQueryImplements the wildcard search query.
WildcardTermEnum Subclass of FilteredTermEnum for enumerating all terms that match the specified wildcard filter term.

Exception Summary

BooleanQuery.TooManyClausesThrown when an attempt is made to add more than getMaxClauseCount() clauses.
Code to search indices.

Table Of Contents

  1. Search Basics
  2. The Query Classes
  3. Changing the Scoring


Search over indices. Applications usually call or,Filter). <!-- FILL IN MORE HERE -->

Query Classes


Of the various implementations of Query, the TermQuery is the easiest to understand and the most often used in applications. A TermQuery matches all the documents that contain the specified Term, which is a word that occurs in a certain Field. Thus, a TermQuery identifies and scores all Documents that have a Field with the specified string in it. Constructing a TermQuery is as simple as:

TermQuery tq = new TermQuery(new Term("fieldName", "term"));
In this example, the Query identifies all Documents that have the Field named "fieldName" containing the word "term".


Things start to get interesting when one combines multiple TermQuery instances into a BooleanQuery. A BooleanQuery contains multiple BooleanClauses, where each clause contains a sub-query (Query instance) and an operator (from BooleanClause.Occur) describing how that sub-query is combined with the other clauses:

  1. SHOULD — Use this operator when a clause can occur in the result set, but is not required. If a query is made up of all SHOULD clauses, then every document in the result set matches at least one of these clauses.

  2. MUST — Use this operator when a clause is required to occur in the result set. Every document in the result set will match all such clauses.

  3. MUST NOT — Use this operator when a clause must not occur in the result set. No document in the result set will match any such clauses.

Boolean queries are constructed by adding two or more BooleanClause instances. If too many clauses are added, a TooManyClauses exception will be thrown during searching. This most often occurs when a Query is rewritten into a BooleanQuery with many TermQuery clauses, for example by WildcardQuery. The default setting for the maximum number of clauses 1024, but this can be changed via the static method setMaxClauseCount in BooleanQuery.


Another common search is to find documents containing certain phrases. This is handled two different ways:

  1. PhraseQuery — Matches a sequence of Terms. PhraseQuery uses a slop factor to determine how many positions may occur between any two terms in the phrase and still be considered a match.

  2. SpanNearQuery — Matches a sequence of other SpanQuery instances. SpanNearQuery allows for much more complicated phrase queries since it is constructed from other SpanQuery instances, instead of only TermQuery instances.


The RangeQuery matches all documents that occur in the exclusive range of a lower Term and an upper Term. For example, one could find all documents that have terms beginning with the letters a through c. This type of Query is frequently used to find documents that occur in a specific date range.

PrefixQuery, WildcardQuery

While the PrefixQuery has a different implementation, it is essentially a special case of the WildcardQuery. The PrefixQuery allows an application to identify all documents with terms that begin with a certain string. The WildcardQuery generalizes this by allowing for the use of * (matches 0 or more characters) and ? (matches exactly one character) wildcards. Note that the WildcardQuery can be quite slow. Also note that WildcardQuery should not start with * and ?, as these are extremely slow. To remove this protection and allow a wildcard at the beginning of a term, see method setAllowLeadingWildcard in QueryParser.


A FuzzyQuery matches documents that contain terms similar to the specified term. Similarity is determined using Levenshtein (edit) distance. This type of query can be useful when accounting for spelling variations in the collection.

Changing Similarity

Chances are DefaultSimilarity is sufficient for all your searching needs. However, in some applications it may be necessary to customize your Similarity implementation. For instance, some applications do not need to distinguish between shorter and longer documents (see a "fair" similarity).

To change Similarity, one must do so for both indexing and searching, and the changes must happen before either of these actions take place. Although in theory there is nothing stopping you from changing mid-stream, it just isn't well-defined what is going to happen.

To make this change, implement your own Similarity (likely you'll want to simply subclass DefaultSimilarity) and then use the new class by calling IndexWriter.setSimilarity before indexing and Searcher.setSimilarity before searching.

If you are interested in use cases for changing your similarity, see the Lucene users's mailing list at Overriding Similarity. In summary, here are a few use cases:

  1. SweetSpotSimilaritySweetSpotSimilarity gives small increases as the frequency increases a small amount and then greater increases when you hit the "sweet spot", i.e. where you think the frequency of terms is more significant.

  2. Overriding tf — In some applications, it doesn't matter what the score of a document is as long as a matching term occurs. In these cases people have overridden Similarity to return 1 from the tf() method.

  3. Changing Length Normalization — By overriding lengthNorm, it is possible to discount how the length of a field contributes to a score. In DefaultSimilarity, lengthNorm = 1 / (numTerms in field)^0.5, but if one changes this to be 1 / (numTerms in field), all fields will be treated "fairly".

In general, Chris Hostetter sums it up best in saying (from the Lucene users's mailing list):
[One would override the Similarity in] ... any situation where you know more about your data then just that it's "text" is a situation where it *might* make sense to to override your Similarity method.

Changing Scoring — Expert Level

Changing scoring is an expert level task, so tread carefully and be prepared to share your code if you want help.

With the warning out of the way, it is possible to change a lot more than just the Similarity when it comes to scoring in Lucene. Lucene's scoring is a complex mechanism that is grounded by three main classes:

  1. Query — The abstract object representation of the user's information need.
  2. Weight — The internal interface representation of the user's Query, so that Query objects may be reused.
  3. Scorer — An abstract class containing common functionality for scoring. Provides both scoring and explanation capabilities.
Details on each of these classes, and their children, can be found in the subsections below.

The Query Class

In some sense, the Query class is where it all begins. Without a Query, there would be nothing to score. Furthermore, the Query class is the catalyst for the other scoring classes as it is often responsible for creating them or coordinating the functionality between them. The Query class has several methods that are important for derived classes:

  1. createWeight(Searcher searcher) — A Weight is the internal representation of the Query, so each Query implementation must provide an implementation of Weight. See the subsection on The Weight Interface below for details on implementing the Weight interface.
  2. rewrite(IndexReader reader) — Rewrites queries into primitive queries. Primitive queries are: TermQuery, BooleanQuery, OTHERS????

The Weight Interface

The Weight interface provides an internal representation of the Query so that it can be reused. Any Searcher dependent state should be stored in the Weight implementation, not in the Query class. The interface defines six methods that must be implemented:

  1. Weight#getQuery() — Pointer to the Query that this Weight represents.
  2. Weight#getValue() — The weight for this Query. For example, the TermQuery.TermWeight value is equal to the idf^2 * boost * queryNorm <!-- DOUBLE CHECK THIS -->
  3. Weight#sumOfSquaredWeights() — The sum of squared weights. For TermQuery, this is (idf * boost)^2
  4. Weight#normalize(float) — Determine the query normalization factor. The query normalization may allow for comparing scores between queries.
  5. Weight#scorer(IndexReader) — Construct a new Scorer for this Weight. See The Scorer Class below for help defining a Scorer. As the name implies, the Scorer is responsible for doing the actual scoring of documents given the Query.
  6. Weight#explain(IndexReader, int) — Provide a means for explaining why a given document was scored the way it was.

The Scorer Class

The Scorer abstract class provides common scoring functionality for all Scorer implementations and is the heart of the Lucene scoring process. The Scorer defines the following abstract methods which must be implemented:

  1. Scorer#next() — Advances to the next document that matches this Query, returning true if and only if there is another document that matches.
  2. Scorer#doc() — Returns the id of the Document that contains the match. It is not valid until next() has been called at least once.
  3. Scorer#score() — Return the score of the current document. This value can be determined in any appropriate way for an application. For instance, the TermScorer returns the tf * Weight.getValue() * fieldNorm.
  4. Scorer#skipTo(int) — Skip ahead in the document matches to the document whose id is greater than or equal to the passed in value. In many instances, skipTo can be implemented more efficiently than simply looping through all the matching documents until the target document is identified.
  5. Scorer#explain(int) — Provides details on why the score came about.

Why would I want to add my own Query?

In a nutshell, you want to add your own custom Query implementation when you think that Lucene's aren't appropriate for the task that you want to do. You might be doing some cutting edge research or you need more information back out of Lucene (similar to Doug adding SpanQuery functionality).