You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@arrow.apache.org by "Micah Kornfield (Jira)" <ji...@apache.org> on 2019/10/24 05:45:00 UTC

[jira] [Resolved] (ARROW-6866) [Java] Improve the performance of calculating hash code for struct vector

     [ https://issues.apache.org/jira/browse/ARROW-6866?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Micah Kornfield resolved ARROW-6866.
------------------------------------
    Fix Version/s: 1.0.0
       Resolution: Fixed

Issue resolved by pull request 5633
[https://github.com/apache/arrow/pull/5633]

> [Java] Improve the performance of calculating hash code for struct vector
> -------------------------------------------------------------------------
>
>                 Key: ARROW-6866
>                 URL: https://issues.apache.org/jira/browse/ARROW-6866
>             Project: Apache Arrow
>          Issue Type: Improvement
>          Components: Java
>            Reporter: Liya Fan
>            Assignee: Liya Fan
>            Priority: Minor
>              Labels: pull-request-available
>             Fix For: 1.0.0
>
>          Time Spent: 1h 20m
>  Remaining Estimate: 0h
>
> Improve the performance of hashCode(int) method for StructVector:
> 1. We can get the child vectors directly, so there is no need to get the name from the child vector and then use the name to get the vector. 
> 2. The child vectors cannot be null, so there is no need to check it.
> The performance improvement depends on the complexity of the hash algorithm. For computational intensive hash algorithms, the improvement can be small; while for simple hash algorithms, the improvement can be notable. 



--
This message was sent by Atlassian Jira
(v8.3.4#803005)