You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hive.apache.org by "Prasanth J (JIRA)" <ji...@apache.org> on 2014/03/27 00:26:24 UTC
[jira] [Commented] (HIVE-6761) Hashcode computation does not use
maximum parallelism for scalable dynamic partitioning
[ https://issues.apache.org/jira/browse/HIVE-6761?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13948644#comment-13948644 ]
Prasanth J commented on HIVE-6761:
----------------------------------
This is the reason of lesser hashcodes generation as mentioned by [~gopalv] here https://issues.apache.org/jira/browse/HIVE-6735?focusedCommentId=13948046&page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel#comment-13948046
> Hashcode computation does not use maximum parallelism for scalable dynamic partitioning
> ---------------------------------------------------------------------------------------
>
> Key: HIVE-6761
> URL: https://issues.apache.org/jira/browse/HIVE-6761
> Project: Hive
> Issue Type: Sub-task
> Components: Query Processor
> Affects Versions: 0.13.0, 0.14.0
> Reporter: Prasanth J
> Assignee: Prasanth J
> Fix For: 0.13.0, 0.14.0
>
> Attachments: HIVE-6761.1.patch
>
>
> Hashcode computation for HIVE-6455 should consider all the partitioning columns and bucket number to distribute the rows. The following code
> {code}
> for (int i = 0; i < partitionEval.length - 1; i++) {
> {code}
> ignores the last partition column thereby generating lesser hashcodes.
--
This message was sent by Atlassian JIRA
(v6.2#6252)