public class SortedSetDocValuesFacetCounts extends Facets
SortedSetDocValuesFacetField,
without require a separate taxonomy index. Faceting is
a bit slower (~25%), and there is added cost on every
IndexReader open to create a new SortedSetDocValuesReaderState. Furthermore, this does
not support hierarchical facets; only flat (dimension +
label) facets, but it uses quite a bit less RAM to do
so.
NOTE: this class should be instantiated and
then used from a single thread, because it holds a
thread-private instance of SortedSetDocValues.
NOTE:: tie-break is by unicode sort order
| Constructor and Description |
|---|
SortedSetDocValuesFacetCounts(SortedSetDocValuesReaderState state,
FacetsCollector hits)
Sparse faceting: returns any dimension that had any
hits, topCount labels per dimension.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<FacetResult> |
getAllDims(int topN)
Returns topN labels for any dimension that had hits,
sorted by the number of hits that dimension matched;
this is used for "sparse" faceting, where many
different dimensions were indexed, for example
depending on the type of document.
|
java.lang.Number |
getSpecificValue(java.lang.String dim,
java.lang.String... path)
Return the count or value
for a specific path.
|
FacetResult |
getTopChildren(int topN,
java.lang.String dim,
java.lang.String... path)
Returns the topN child labels under the specified
path.
|
public SortedSetDocValuesFacetCounts(SortedSetDocValuesReaderState state, FacetsCollector hits) throws java.io.IOException
java.io.IOExceptionpublic FacetResult getTopChildren(int topN, java.lang.String dim, java.lang.String... path) throws java.io.IOException
FacetsgetTopChildren in class Facetsjava.io.IOExceptionpublic java.lang.Number getSpecificValue(java.lang.String dim,
java.lang.String... path)
FacetsgetSpecificValue in class Facetspublic java.util.List<FacetResult> getAllDims(int topN) throws java.io.IOException
FacetsgetAllDims in class Facetsjava.io.IOExceptionCopyright © 2000–2017 The Apache Software Foundation. All rights reserved.