[
https://issues.apache.org/jira/browse/ARROW-8494?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17185583#comment-17185583
]
Micah Kornfield commented on ARROW-8494:
----------------------------------------
Yes [~apitrou] that matches my understanding, I have an algorithm that I think
might work fairly well for the more complicated list cases but probably has
diminishing returns as the level of nesting grows.
> [C++] Implement vectorized array reassembly logic
> -------------------------------------------------
>
> Key: ARROW-8494
> URL: https://issues.apache.org/jira/browse/ARROW-8494
> Project: Apache Arrow
> Issue Type: Sub-task
> Components: C++
> Reporter: Micah Kornfield
> Assignee: Micah Kornfield
> Priority: Major
>
> This logic would attempt to create the data necessary for each field by
> passing through the levels once for each field. it is expected that due to
> SIMD this will perform better for nested data with shallow nesting, but due
> to repetitive computation might perform worse for deep nested that include
> List-types.
>
> At a high level the logic would be structured as:
> {{for each field:}}
> {{ for each rep/def level entry:}}
> {{ update null bitmask and offsets.}}
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
