Description
In some use cases, particularly use cases with time series data, using collection alias and partitioning data into multiple small collections using timestamp, a filter query can match all documents in a collection. Currently BitDocSet is used which contains a large array of long integers with every bits set to 1. After querying, the resulted DocSet saved in filter cache is large and becomes one of the main memory consumers in these use cases.
For example. suppose a Solr setup has 14 collections for data in last 14 days, each collection with one day of data. A filter query for last one week data would result in at least six DocSet in filter cache which matches all documents in six collections respectively.
This is to design a new DocSet that is memory efficient for such a use case. The new DocSet removes the large array, reduces memory usage and GC pressure without losing advantage of large filter cache.
In particular, for use cases when using time series data, collection alias and partition data into multiple small collections using timestamp, the gain can be large.
For further optimization, it may be helpful to design a DocSet with run length encoding. Thanks mmokhtar for suggestion.
Attachments
Attachments
Issue Links
- relates to
-
SOLR-10057 Evaluate/Design a MatchMost/MatchAll doc set
-
- Open
-
-
-
- Open
-