pitrou opened a new issue, #39798: URL: https://github.com/apache/arrow/issues/39798
### Describe the enhancement requested Currently, calling the Take and Filter functions on a fixed-size list of primitive types will use the following algorithm: 1. generate an array of child indices into the values array (for example, taking indices [1, 2] on a `fixed_size_list<T, 3>` array will generate child indices [3, 4, 5, 6, 7, 8]) 2. call Take on the values array and the child indices But, when the fixed-size list's value type is a fixed-width primitive type such as numbers or even fixed-size binary (example : a fixed-shape tensor), then we could simply Take or Filter directly on the values array, using the appropriate byte width. For example, filtering a `fixed_size_list<int32, 3>` can use the same algorithm as filtering a `fixed_size_binary<12>`. This should be much faster. ### 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: issues-unsubscr...@arrow.apache.org.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
