Rich-T-kid opened a new issue, #11413:
URL: https://github.com/apache/arrow-rs/issues/11413

   `arrow_cmp::make_comparator` for `DictionaryArray` runs a boxed `str::cmp` 
on every slot call, ignoring the fact that dictionary values are a small 
bounded set. Sort/rank over N rows costs O(N log N) string compares regardless 
of distinct value count K.
   
   Precomputing a shared `u32` rank per dictionary value inside 
`make_comparator` would reduce each slot call to a `u32::cmp`.
   


-- 
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]

Reply via email to