- All Implemented Interfaces:
public class FieldCacheTermsFilter
- extends Filter
This is the same functionality as TermsFilter (from
contrib/queries), except this filter requires that the
field contains only a single term for all documents.
Because of drastically different implementations, they
also have different performance characteristics, as
The first invocation of this filter on a given field will
be slower, since a
Filter that only accepts documents whose single
term value in the specified field is contained in the
provided set of allowed terms.
FieldCache.StringIndex must be
created. Subsequent invocations using the same field
will re-use this cache. However, as with all
functionality based on
FieldCache, persistent RAM
is consumed to hold the cache, and is not freed until the
IndexReader is closed. In contrast, TermsFilter
has no persistent RAM consumption.
With each search, this filter translates the specified
set of Terms into a private
OpenBitSet keyed by
term number per unique
IndexReader (normally one
reader per segment). Then, during matching, the term
number for each docID is retrieved from the cache and
then checked for inclusion using the
Since all testing is done using RAM resident data
structures, performance should be very fast, most likely
fast enough to not require further caching of the
DocIdSet for each possible combination of terms.
However, because docIDs are simply scanned linearly, an
index with a great many small documents may find this
linear scan too costly.
In contrast, TermsFilter builds up an
keyed by docID, every time it's created, by enumerating
through all matching docs using
TermDocs to seek
and scan through each term's docID list. While there is
no linear scan of all docIDs, besides the allocation of
the underlying array in the
approach requires a number of "disk seeks" in proportion
to the number of terms, which can be exceptionally costly
when there are cache misses in the OS's IO cache.
Generally, this filter will be slower on the first
invocation for a given field, but subsequent invocations,
even if you change the allowed set of Terms, should be
faster than TermsFilter, especially as the number of
Terms being matched increases. If you are matching only
a very small number of terms, and those terms in turn
match a very small number of documents, TermsFilter may
Which filter is best is very application dependent.
- See Also:
- Serialized Form
|Methods inherited from class org.apache.lucene.search.Filter
|Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public FieldCacheTermsFilter(String field,
public FieldCache getFieldCache()
public DocIdSet getDocIdSet(IndexReader reader)
- Description copied from class:
- Creates a
DocIdSet enumerating the documents that should be
permitted in search results. NOTE: null can be
returned if no documents are accepted by this Filter.
Note: This method will be called once per segment in
the index during searching. The returned
must refer to document IDs for that segment, not for
the top-level reader.
getDocIdSet in class
reader - a
IndexReader instance opened on the index currently
searched on. Note, it is likely that the provided reader does not
represent the whole underlying index i.e. if the index has more than
one segment the given reader only represents a single segment.
- a DocIdSet that provides the documents which should be permitted or
prohibited in search results. NOTE: null can be returned if
no documents will be accepted by this Filter.
- See Also:
Copyright © 2000-2010 Apache Software Foundation. All Rights Reserved.