Kanishk-Dendukuri opened a new issue, #50645: URL: https://github.com/apache/arrow/issues/50645
### Describe the enhancement requested The variadic min_element_wise / max_element_wise kernels (ScalarMinMax in scalar_compare.cc) fold arguments using a multi pass approach: an antiextreme sentinel fill, a separate validity bitmap pass (BitmapOr/BitmapAnd), and a per element value pass with a per element validity branch. This can be rewritten as a single word at a time pass (handling validity 64 bits at a time) that fuses validity and value computation and keeps fully valid words branchless. That removes the redundant passes and the per element mispredicting branch, giving a measured ~2-13x speedup on numeric types (varying with shape and null density), with no behavioral change. ### Component(s) C++ -- 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]
