[
https://issues.apache.org/jira/browse/SOLR-9125?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15287401#comment-15287401
]
Joel Bernstein commented on SOLR-9125:
--------------------------------------
What I was thinking was to first run the query and get the cardinality. But
this is really not fun as the CollapsingQParserPlugin would have to know the
main query and all the filter queries. Doesn't sound like it would be fun to
write or maintain.
> CollapseQParserPlugin allocations are index based, not query based
> ------------------------------------------------------------------
>
> Key: SOLR-9125
> URL: https://issues.apache.org/jira/browse/SOLR-9125
> Project: Solr
> Issue Type: Improvement
> Components: query parsers
> Reporter: Jeff Wartes
> Priority: Minor
> Labels: collapsingQParserPlugin
>
> Among other things, CollapsingQParserPlugin’s OrdScoreCollector allocates
> space per-query for:
> 1 int (doc id) per ordinal
> 1 float (score) per ordinal
> 1 bit (FixedBitSet) per document in the index
>
> So the higher the cardinality of the thing you’re grouping on, and the more
> documents in the index, the more memory gets consumed per query. Since high
> cardinality and large indexes are the use-cases CollapseQParserPlugin was
> designed for, I thought I'd point this out.
> My real issue is that this does not vary based on the number of results in
> the query, either before or after collapsing, so a query that results in one
> doc consumes the same amount of memory as one that returns all of them. All
> of the Collectors suffer from this to some degree, but I think OrdScore is
> the worst offender.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
