Details
-
Improvement
-
Status: Open
-
Major
-
Resolution: Unresolved
-
None
-
None
-
None
Description
Faceting on a high cardinality field and sorting by unique values in a different high cardinality field uses a lot of memory. We should implement an alternative method and pick the correct method based on index statistics and domain size.
Attachments
Issue Links
- relates to
-
SOLR-11806 Use indirection for hash-based faceting
- Open