suryanshcode2601 commented on issue #20134: URL: https://github.com/apache/datafusion/issues/20134#issuecomment-3853218626
Hi, I’d like to work on this if it’s still available. From my understanding, the current implementation ends up re-traversing the entire expression tree for each node during the main recursion. I’m planning to restructure this so simplify_const_expr is computed once per expression subtree and reused, instead of being recalculated inside the recursive transformation loop. I’ll aim to keep the behavior identical while reducing redundant work, and add tests to cover the change. Please let me know if this approach sounds reasonable before I start. Thanks! -- 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]
