alamb commented on issue #6822: URL: https://github.com/apache/datafusion/issues/6822#issuecomment-2749338072
I believe the plans also effectively hash the group keys three times for aggregate plans: 1. initial hash to find the group in the initial aggregate phase 2. hash to compute the output partition 3. hash (again) to find the group in the final aggregation phase Passing along the pre-computed hashes, especially for strings, might be significiantly faster -- 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]
