[ARROW-9842] [C++] Explore alternative strategy for Compare kernel implementation for better performance

• Type: Improvement
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Component/s: C++
• External issue URL: https://github.com/apache/arrow/issues/25880
• Assignee: Unassigned
• Reporter: Wes McKinney
• Created: 24/Aug/20 16:32
• Updated: 11/Jan/23 08:09

Description

The compiler may be able to vectorize comparison options if the bitpacking of results is deferred until the end (or in chunks). Instead, a temporary bytemap can be populated on a chunk-by-chunk basis and then the bytemaps can be bitpacked into the output buffer. This may also reduce the code size of the compare kernels (which are actually quite large at the moment)