Affects Version/s: None
Fix Version/s: 7.5
Let's say I have a dataset of a 100M document
After applying a filter the number of documents found would be 5k so it's tiny.
If I do a search and a rollup stream the query returns in the 200ms range.
But if by mistake I add the "partitionKeys" param to the search stream the hash query parser is invoked which runs on the entire document set and the query time spikes up to 7 seconds.
If we aren't providing a parallel stream we should ignore the partitionKeys param
Because of the partitionKeys the underlying query formed is:
This is a dummy dataset so don't see the the hits and QTime but this query certainly doesn't need to add the hash query parser filter clause for workers=1