xiangfu0 opened a new pull request, #19799: URL: https://github.com/apache/pinot/pull/19799
Repeated short StarTree leaf ranges repeatedly resize buffer array containers. Build ranges in a heap bitmap and convert once for downstream filters, keeping aggregate-only matches on the existing buffer path. Reproduce: query a StarTree with thousands of one- or two-document leaf ranges in the same 65,536-ID bitmap container while grouping by a dimension below those leaves. Validation: 18 focused tests and scoped style/license checks pass on JDK 25. Local JMH on a generated 352,832-row mmap segment (three forks/query, full server plan plus serialization) reduces allocation by 35.65% for mixed group-by, 53.92% for residual group-by and 96.04% for range-count, with aggregate-only allocation effectively unchanged and complete row/schema/decoded-wire parity; dense/wider ranges still pay conversion overhead, and general latency gains remain unproven. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
