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

Posted to dev@arrow.apache.org by "Liya Fan (Jira)" <ji...@apache.org> on 2019/10/12 12:34:00 UTC

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

Liya Fan created ARROW-6866:
-------------------------------

             Summary: [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


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)