gianm opened a new pull request, #19012: URL: https://github.com/apache/druid/pull/19012
Implement two timeBoundary-style optimizations for MSQ: 1) Filter base inputs to include only the earliest (for min) or latest (for max) segments. 2) Use TimeBoundaryInspector when available. Unlike the native query path, the SQL planner still emits a groupBy query or groupBy stage. The decisions about what to optimize happen at execution time. This makes the optimization simpler, as there is no need for a special timeBoundary query type that must be capable of operating over all kinds of data. It also simplifies planning. -- 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]
