[
https://issues.apache.org/jira/browse/SOLR-153?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12921489#action_12921489
]
Peter Karich commented on SOLR-153:
-----------------------------------
> That's really the only case where our existing algorithms fall down.
but that is quite common ... like in my case ;-)
hmmh, I will see if I have time.
This is one line where I need to replace the 'old intersection' with the new
one which uses the precalculated tree:
c = searcher.numDocs(new TermQuery(t), docs, deState);
right?
But I don't understand the part where where df > minDfFilterCache ... What is a
'(Multi)DocsEnum' ? I'll investigate this!
> Facet Index
> -----------
>
> Key: SOLR-153
> URL: https://issues.apache.org/jira/browse/SOLR-153
> Project: Solr
> Issue Type: New Feature
> Reporter: Yonik Seeley
> Attachments: facettree.patch, facettree.patch
>
>
> A facet index, initially for non-hierarchical facets.
> Start with all terms, and a set of documents for each term. Group lower
> level nodes by taking the union of the sets, but keep track of the largest
> set going back all the way to the leaves (the max doc-freq for that node).
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
