[
https://issues.apache.org/jira/browse/SOLR-153?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12921456#action_12921456
]
Peter Karich commented on SOLR-153:
-----------------------------------
> It looks like my work pre-dates their work
great ! :-)
Now this is interesting for me, because they say their 'bitset tree' performs
nice for non-hierarchical facets in two cases: when someone needs a combination
of facets or 'bitset trees are beneficial when the facet domain is relatively
large'. (Although memory consumption is heavier without their WAH compression)
How much work would it to integrate your work into facets? E.g. to get an idea
on real data?
> 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]
