Description

In OpenSearch, we have introduced multi range traversal for collecting matching document count in single tree traversal (opensearch-project/OpenSearch#13317). That has helped improve the performance of numeric aggregations in OpenSearch significantly. I am wondering if there are other use cases that can benefit from this and change should be included in Lucene.

Constraints:

1. The ranges are non-overlapping and in increasing order. For example - In (a1,b1),(a2,b2)...(an,bn), it is assumed ai<aj for all i<j and bi < a(i+1) for every i
2. Field is 1 dimensional guaranteeing the points are stored in increasing order, and segment does not have any deletions